Skip to main content

More Algebras for Determiners

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3492))

Abstract

Some new algebras, which are possible denotations for various determiners, are studied. One of them is the algebra of generalised cardinal quantifiers which is a sub-algebra of conservative quantifiers and which contains cardinal, co-cardinal and proportional quantifiers. In addition some non-conservative quantifiers are studied (symmetric, contrapositional and fixed points with respect to the post-complement). It is shown that co-intersective quantifiers are contrapositional. The analysis is extended to quantifiers of higher types.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise, J., Cooper, R.: Generalized quantifiers and natural language. Linguistics and Philosophy 4, 159–219 (1981)

    Article  MATH  Google Scholar 

  2. Beghelli, F.: Comparative Quantifiers. In: Dekker, P., Stokhof, M. (eds.) Proc. of the VIII Amsterdam Colloquium (1992)

    Google Scholar 

  3. Beghelli, F.: Structured Quantifiers. In: Kanazawa, M., Piñon, C. (eds.) Dynamics, Polarity, and Quantification, pp. 119–145. CSLI Publications, Stanford (1994)

    Google Scholar 

  4. Gutiérrez-Rexach, J.: Questions and Generalized Quantifiers. In: Szabolcsi, A. (ed.) Ways of Scope Taking, pp. 409–452. Kluwer, Dordrecht (1997)

    Google Scholar 

  5. Keenan, E.L.: Natural Language, Sortal Reducibility and Generalised Quantifiers. Journal of Symbolic logic 58(1), 314–325 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Keenan, E.L.: Some Properties of Natural Language Quantifiers: Generalized Quantifier Theory. Linguistics and Philosophy 25(5-6), 627–654 (2002)

    Article  Google Scholar 

  7. Keenan, E.L.: The Definiteness Effect: Semantics or Pragmatics. Natural Language Semantics 3(2), 187–216 (2003)

    Article  Google Scholar 

  8. Keenan, E.L.: Excursions in Natural Logic, forthcoming. In: Casadio, C., et al. (eds.) Language and Grammar: Studies in Mathematical Linguistics and Natural Language, pp. 3–24. CSLI, Stanford (in press)

    Google Scholar 

  9. Keenan, E.L., Faltz, L.M.: Boolean Semantics for Natural Language. D. Reidel Publishing Company, Dordrecht (1985)

    MATH  Google Scholar 

  10. Keenan, E.L., Moss, L.: Generalized quantifiers and the expressive power of natural language. In: van Benthem, J., ter Meulen, A. (eds.) Generalized Quantifiers, Foris, Dordrecht, pp. 73–124 (1985)

    Google Scholar 

  11. Keenan, E.L., Stavi, J.: A semantic characterisation of natural language determiners. Linguistics and Philosophy 9, 253–326 (1986)

    Article  MATH  Google Scholar 

  12. Keenan, E.L., Westerstahl, D.: Generalized Quantifiers in Linguistics and Logic. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 837–893. Elsevier, Amsterdam (1997)

    Chapter  Google Scholar 

  13. Mostowski, A.: On a generalisation of quantifiers. Fundamenta Mathematicae 44, 12–36 (1957)

    MathSciNet  Google Scholar 

  14. Thijsse, E.: Counting Quantifiers. In: van Benthem, J., ter Meulen, A. (eds.) Generalized Quantifiers, Foris, Dordrecht, pp. 127–146 (1984)

    Google Scholar 

  15. Väänänen, J., Westerstahl, D.: On the Expressive Power of Monotone Natural Language Quantifiers over Finite Models. Journal of Philos. Logic 31(4), 327–358 (2002)

    Article  MATH  Google Scholar 

  16. Zuber, R.: On the Semantics of Exclusion and Inclusion Phrases. In: Lawson, A. (ed.) SALT8, pp. 267–283. Cornell University Press (1998)

    Google Scholar 

  17. Zuber, R.: On Inclusive Questions. In: Billerey, et al. (eds.) WCCFL 19 Proceedings, pp. 617–630. Cascadilla Press (2000)

    Google Scholar 

  18. Zuber, R.: A class of non-conservative determiners in Polish. Linguisticae Investigationes 27(1), 147–165 (2004a)

    Article  Google Scholar 

  19. Zuber, R.: Some remarks on syncategorematicity. In: Hunyadi, L., et al. (eds.) The Eight Symposium on Logic and Language: Preliminary Papers, Debrecen, pp. 165–174 (2004b)

    Google Scholar 

  20. Zuber, R.: Une caractérisation algébrique des quantificateurs logiques (unpublished)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zuber, R. (2005). More Algebras for Determiners. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_23

Download citation

  • DOI: https://doi.org/10.1007/11422532_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25783-7

  • Online ISBN: 978-3-540-31953-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics