Content deleted Content added
Citation bot (talk | contribs) Alter: pages, issue. Add: volume. Formatted dashes. | Use this bot. Report bugs. | Suggested by Corvus florensis | #UCB_webform 900/3500 |
m Open access bot: url-access updated in citation with #oabot. |
||
(3 intermediate revisions by 3 users not shown) | |||
Line 1:
{{Short description|Expression denoting a set of sets in formal semantics}}
In [[formal semantics (natural language)|formal semantics]], a '''generalized quantifier''' ('''GQ''') is an expression that denotes a [[set of sets]]. This is the standard semantics assigned to [[Quantifier (logic)|quantified]] [[noun phrase]]s. For example, the generalized quantifier ''every boy'' denotes the set of sets of which every boy is a member:
<math display="block">\{X \mid \forall x (x \text{ is a boy} \to x \in X) \}</math>
This treatment of quantifiers has been essential in achieving a [[compositionality|compositional]] [[semantics]] for sentences containing quantifiers.<ref>{{cite book |last1=Montague |first1=Richard |author-link1=Richard Montague |date=1974 |url=http://www.blackwellpublishing.com/content/BPL_Images/Content_store/Sample_chapter/9780631215417/Portner.pdf |chapter=The proper treatment of quantification in English |title=Philosophy, Language, and Artificial Intelligence |series=Studies in Cognitive Systems |volume=2
|editor1-last=Kulas |editor1-first=J. |editor2-last=Fetzer |editor2-first=J.H. |editor3-last=Rankin |editor3-first=T.L. |pages=141–162 |publisher=Springer, Dordrecht |doi=10.1007/978-94-009-2727-8_7|isbn=978-94-010-7726-2 }}</ref><ref name=Barwise>{{cite journal |last1=Barwise |first1=Jon |author-link1=Jon Barwise |last2=Cooper |first2=Robin |date=1981 |title=Generalized quantifiers and natural language |url=https://link.springer.com/article/10.1007%2FBF00350139 |journal=Linguistics and Philosophy |volume=4 |issue=2 |pages=159–219 |doi=10.1007/BF00350139|url-access=subscription }}</ref>
==Type theory==
Line 71 ⟶ 72:
#Exactly three students ran.
#Exactly three students ran fast.
The first sentence
The lambda term for the (complex) [[determiner (linguistics)|determiner]] ''exactly three'' is the following. It says that the [[cardinality]] of the [[Intersection (set theory)|intersection]] between the two sets equals 3.
|