A Note on the Monotonicity of Reducible Quantifiers

Article
  • 41 Downloads

Abstract

We provide necessary and sufficient conditions determining how monotonicity of some classes of reducible quantifiers depends on the monotonicity of simpler quantifiers of iterations to which they are equivalent.

Keywords

Reducible quantifiers Monotonicity Continuous quantifiers 

References

  1. Keenan E. L. (1992) Beyong the frege boundary. Linguistics and Philosophy 15: 199–221CrossRefGoogle Scholar
  2. Keenan E. L., Westerståhl D. (1997) Generalized Quantifiers in Linguistics and Logic. In: van Benthem J., ter Meulen A. (eds) Handbook of logic and language. Elsevier, Amsterdam, pp 837–893CrossRefGoogle Scholar
  3. Peters S., Westerståhl D. (2006) Quantifiers in language and logic. Clarendon, OxfordGoogle Scholar
  4. Thijse E. (1983) On Some Proposed Universals in Natural Language. In: Ter Meulen (eds) Studies in modeltheoretic semantics. Foris, Dordrecht, pp 19–36Google Scholar
  5. Westerståhl D. (1994) Iterated Quantifiers. In: Kanazawa M., Pinon Ch. (eds) Dynamics, polarity and quantification. CSLI, Stanford University, Stanford, pp 173–209Google Scholar
  6. Zuber R. (2007) Indépendence faible des quantificateurs. Logique et Analyse 198: 173–178Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2009

Authors and Affiliations

  1. 1.CNRSParisFrance

Personalised recommendations