|Quantifiers: in the predicate logic, quantifiers are the symbol combinations (Ex) and (x) for the set of objects to which one or more properties are attributed to. A) Existence quantification (Ex)(Fx) ("At least one x"). B) Universal quantification (x)(Fx) ("Everything is F"). For other objects e.g. y, z,… are chosen. E.g. (x) (Ey) (Fx > Gy). See also quantification, generalized quantifiers._____________Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments. |
Books on Amazon
Weak quantifier/Milsarik/Semantics/linguistics/Stechow: e.g. one, no (without existence presupposition) - E.g. Paula is a/No cat - but not - "Paula is every cat" (strong quantifier) - strong: e.g. "most" - strong qu: with presupposition._____________Explanation of symbols: Roman numerals indicate the source, arabic numerals indicate the page number. The corresponding books are indicated on the right hand side. ((s)…): Comment by the sender of the contribution.
|A. von Stechow
I Arnim von Stechow Schritte zur Satzsemantik