The semantics of fuzzy quantifiers
The aim of this thesis is to discuss the semantics of FQs (fuzzy quantifiers), formal semantics in particular. The approach used is fuzzy semantic based on fuzzy set theory (Zadeh 1965, 1975), i.e. we explore primarily the denotational meaning of FQs represented by membership functions. Some empirical data from both Chinese and English is used for illustration. A distinguishing characteristic of the semantics of FQs like about 200 students and many students as opposed to other sorts of quantifiers like every student and no students, is that they have fuzzy meaning boundaries. There is considerable evidence to suggest that the doctrine that a proposition is either true or false has a limited application in natural languages, which raises a serious question towards any linguistic theories that are based on a binary assumption. In other words, the number of elements in a domain that must satisfy a predicate is not precisety given by an FQ and so a proposition conÂŹ taining one may be more or less true depending on how closely numbers of elements approximate to a given norm. The most significant conclusion drawn here is that FQs are compositional in that FQs of the same type function in the same way to generate
Zhang, Qiao
The semantics of fuzzy quantifiers. The aim of this thesis is to discuss the semantics of FQs (fuzzy quantifiers), formal semantics in particular. The approach used is fuzzy semantic based on fuzzy set theory (Zadeh 1965, 1975), i.e. we explore primarily the denotational meaning of FQs represented by membership functions. Some empirical data from both Chinese and English is used for illustration. A distinguishing characteristic of the semantics of FQs like about 200 students and many students as opposed to other sorts of quantifiers like every student and no students, is that they have fuzzy meaning boundaries. There is considerable evidence to suggest that the doctrine that a proposition is either true or false has a limited application in natural languages, which raises a serious question towards any linguistic theories that are based on a binary assumption. In other words, the number of elements in a domain that must satisfy a predicate is not precisety given by an FQ and so a proposition conÂŹ taining one may be more or less true depending on how closely numbers of elements approximate to a given norm. The most significant conclusion drawn here is that FQs are compositional in that FQs of the same type function in the same way to generate
semantics fuzzy quantifier aim discus semantics fuzzy quantifier formal_semantics particular use fuzzy semantic base fuzzy set_theory explore primarily meaning represent membership function empirical_data chinese_english use illustration distinguish characteristic semantics like student many student oppose sort quantifier like every student student fuzzy meaning boundary considerable evidence_suggest doctrine proposition either true_false limited application natural_language raise serious question towards linguistic_theory base binary assumption word number element domain must satisfy predicate give proposition may less true depend closely number element approximate give norm significant conclusion_drawn compositional type function way generate