Natural language, sortal reducibility and generalized quantifiers
Journal of Symbolic Logic 58 (1):314-325 (1993)
| Abstract | Recent work in natural language semantics leads to some new observations on generalized quantifiers. In § 1 we show that English quantifiers of type $ $ are booleanly generated by their generalized universal and generalized existential members. These two classes also constitute the sortally reducible members of this type. Section 2 presents our main result--the Generalized Prefix Theorem (GPT). This theorem characterizes the conditions under which formulas of the form Q1x 1⋯ Qnx nRx 1⋯ xn and q1x 1⋯ qnx nRx 1⋯ xn are logically equivalent for arbitrary generalized quantifiers Qi, qi. GPT generalizes, perhaps in an unexpectedly strong form, the Linear Prefix Theorem (appropriately modified) of Keisler & Walkoe (1973) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJuha Kontinen & Jakub Szymanik (2011). Characterizing Definability of Second-Order Generalized Quantifiers. In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Martin van den Berg (1996). Dynamic Generalized Quantifiers. In J. van der Does & Van J. Eijck (eds.), Quantifiers, Logic, and Language. Stanford University.
Anna Szabolcsi (2010). Quantification. Cambridge University Press.
Dorit Ben Shalom (2003). One Connection Between Standard Invariance Conditions on Modal Formulas and Generalized Quantifiers. Journal of Logic, Language and Information 12 (1):47-52.
Dorit Ben Shalom (2003). One Connection Between Standard Invariance Conditions on Modal Formulas and Generalized Quantifiers. Journal of Logic, Language and Information 12 (1).
Lauri Hella, Jouko Väänänen & Dag Westerståhl (1997). Definability of Polyadic Lifts of Generalized Quantifiers. Journal of Logic, Language and Information 6 (3):305-335.
Hanoch Ben-Yami (2009). Generalized Quantifiers, and Beyond. Logique Et Analyse (208):309-326.
Juha Kontinen (2006). The Hierarchy Theorem for Second Order Generalized Quantifiers. Journal of Symbolic Logic 71 (1):188 - 202.
Lauri Hella, Kerkko Luosto & Jouko Väänänen (1996). The Hierarchy Theorem for Generalized Quantifiers. Journal of Symbolic Logic 61 (3):802-817.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads15 ( #79,731 of 556,840 )Recent downloads (6 months)1 ( #64,931 of 556,840 )How can I increase my downloads? |
My notes
Discussion
