Abstract
We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties – here called CE quantifiers – one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further identify a stronger form of monotonicity, called smoothness, which also has linguistic relevance, and we extend our considerations to smooth quantifiers. The results lead us to propose two tentative universals concerning monotonicity and natural language quantification. The notions involved as well as our proofs are presented using a graphical representation of quantifiers in the so-called number triangle.
Similar content being viewed by others
REFERENCES
Barwise, J. and Cooper, R.: Generalized quantifiers and natural language, Linguistics & Philosophy 4 (1981), 159-219.
van Benthem, J.: Questions about quantifiers, J. Symbolic Logic 49 (1984), 443-466.
van Benthem, J.: Essays in Logical Semantics, D. Reidel, Dordrecht, 1986.
Graham, R., Rotschild, B. and Spencer, J.: Ramsey Theory, Wiley, New York, 1990.
Hella, L., Luosto, K. and Väänänen, J.: The hierarchy theorem for generalized quantifiers, J. Symbolic Logic 61 (1996), 802-819.
Keenan, E. and Stavi, J.: A semantic characterization of natural language determiners, Linguistics & Philosophy 9 (1986), 253-326.
Keenan, E. and Westerståhl, D.: Generalized quantifiers in linguistics and logic, in J. van Benthem and A. ter Meulen (eds.), Handbook of Logic and Language, Elsevier, Amsterdam, 1997, 837-893.
Kolaitis, Ph. and Väänänen, J.: Generalized quantifiers and pebble games on finite structures, Ann. Pure Appl. Logic 74 (1995), 23-75.
Luosto, K.: Ramsey theory is needed for solving definability problems of generalized quantifiers, in Lecture Notes in Comput. Sci. 1754, Springer, Berlin, 1999, pp. 121-134.
Väänänen, J.: Unary quantifiers on finite models, Journal of Logic, Language and Information 6 (1997), 275-304.
Westerståhl, D.: Quantifiers in formal and natural languages, in D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logic, Vol. IV, D.Reidel, Dordrecht, 1989, pp. 1-131.
Westerståhl, D.: Relativization of quantifiers in finite models, in J. van der Does and J. van Eijck (eds.), Generalized Quantifier Theory and Applications, ILLC, Amsterdam, 1991, pp. 187-205. Also in Quantifiers: Logic, Models and Computation (same editors), CSLI Publications, Stanford, 1996, pp. 375-383.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Väänänen, J., Westerståhl, D. On the Expressive Power of Monotone Natural Language Quantifiers over Finite Models. Journal of Philosophical Logic 31, 327–358 (2002). https://doi.org/10.1023/A:1019934611163
Issue Date:
DOI: https://doi.org/10.1023/A:1019934611163