Abstract
This paper, extending Keenan’s (1987, 1988) Case-extension of generalized quantifiers, proposes a natural algebraic semantics of DP-coordination and DP-composition. DPs in subject and non-subject positions are uniformly identified as a case-extension of a usual generalized quantifier, and DPs with different semantic cases combine with each other to yield polyadic quantifiers. The paper proves that each set of case-extensions forms a complete atomic Boolean algebra consisting of a full set of unary quantifiers, and it further shows that natural language requires the full power of binary quantification, i.e., the full set of (Fregean) reducible and unreducible binary quantifiers. This result, Type <2> Effability, is derived from the fact that the set of all binary quantifiers can be constructed by taking the meet/join closure of the set of (composed) reducible type <2> quantifiers. This fact is illustrated with non-constituent coordination constructions (e.g., gapping in English and Korean), whose interpretation requires arbitrary meets and joins of reducible binary quantifiers.
Similar content being viewed by others
References
D. Dowty (1988) Type Raising, Functional Composition, and Non-Constituent Conjunction R.T. Oehrle E. Bach D. Wheeler (Eds) Categorial Grammar and Natural Language Structures D. Reidel Dordrecht
H. Hendriks (1988) Type Change in Semantics: The Scope of Quantification and Coordination E. Klein J. Benthem Particlevan (Eds) Categories, Polymorphism and Unification. Center for Cognitive Science University of Edinburgh, and Institute for Language, Logic and Information Amsterdam
E.L. Keenan (1987) Semantic Case Theory J. Groenendijk M. Stokhof (Eds) Proceedings of the Sixth Amsterdam Colloquium Foris Publications Dordrecht
E.L. Keenan (1988) On Semantics and Binding Theory Hawkins (Eds) Explaining Language Universals Basil Blackwell New York
E.L. Keenan (1992) ArticleTitleBeyond the Frege Boundary Linguistics and Philosophy 15 199–221 Occurrence Handle10.1007/BF00635807
E.L. Keenan L.M. Faltz (1985) Boolean Semantics for Natural Language D. Reidel Dordrecht
Keenan E. L. and Moss L. (1985) Generalized Quantifiers and the Expressive Power of Natural Language. In: van Benthem J. and ter Meulen A. (eds.), Generalized Quantifiers in Natural Languages. GRASS Vol. 4.
E.L. Keenan A. Timberlake (1988) Natural Language Motivation for Extending Categorial Grammar R.T. Oehrle (Eds) et al. Categorial Grammar and Natural Language Structures D. Reidel Dordrecht
E.L. Keenan D. Westerståhl (1997) Generalized Quantifiers in Linguistics and Logic J. Benthem Particlevan A. Meulen Particleter (Eds) Handbook of Logic and Language Elsevier Amsterdam
J. McCloskey (1986) ArticleTitleInflection and Conjunction in Modern Irish Natural Language and Linguistic Theory 4 IssueID2 245–281 Occurrence Handle10.1007/BF00133846
M. Moortgat (1988) Categorial Investigation: Logical and Linguistic Aspects of the Lambek Calculus ICG Printing Dordrecht
R.T. Oehrle (1987) Boolean Properties in the Analysis of Gapping G.J. Huck A.E. Ojeda (Eds) Syntax and Semantics Academic Press New York
Sag I. (1977) Deletion and Logical Form. Doctoral dissertation, MIT.
M.J. Steedman (1990) ArticleTitleGapping as Constituent Coordination Linguistics and Philosophy 13 207–263 Occurrence Handle10.1007/BF00630734
J. Benthem ParticleVan (1989) ArticleTitle‘Polyadic Quantifiers Linguistics and Philosophy 12 437–464 Occurrence Handle10.1007/BF00632472
E. Zimmermann (1987) Transparent Adverbs and Scopeless Quantifiers J. Groenendijk D. Jongh Particlede M. Stokhof (Eds) Foundations of Pragmatics and Lexical Semantics Foris Publications Dordrecht
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Nam, S. n-ary Quantifiers and the Expressive Power of DP-Compositions. Research Language Computation 3, 411–428 (2005). https://doi.org/10.1007/s11168-006-0005-9
Issue Date:
DOI: https://doi.org/10.1007/s11168-006-0005-9