Skip to main content
SpringerLink
Log in

Pre-Ordered Quantifiers in Elementary Sentences of Natural Language

  • Chapter
Book cover Quantifiers: Logics, Models and Computation

Part of the book series: Synthese Library ((SYLI,volume 249))

  • 127 Accesses

Abstract

An elementary (English) sentence (e.e.s.) consists of a single predicate (verb) with its obligatory NP-arguments (always considered as quantifier phrases), each containing a specifier and a count noun.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. I. Bellert, Feature System for Quantification Structures in Natural Language, Groningen-Amsterdam Studies in Semantics (GRASS), Foris Publications, Dordrecht - Holland/Providence RI - U.S.A., 1989.

    Google Scholar 

  3. I. Bellert and M. Zawadowski, Pre-order structure of linguistic quant-fiers, typescript, McGill University, 1988.

    Google Scholar 

  4. J. D. Fodor and I. A. Sag, Referential and quantificational indefinites, Linguistics and Philosophy 5 (1982), pp. 355–398.

    Google Scholar 

  5. L. Henkin, Some remarks on infinitely long formulas,Proceedings of the Symposium on Infinitary Methods, Warsaw, (1959), pp. 167-183.

    Google Scholar 

  6. R. M. Kempsonand A. Mccormack, Ambiguity and quantification,Linguistics and Philosophy 4 (1981), pp. 259–309.

    Google Scholar 

  7. R. P. Stanley, Enumeration of posets generated by disjoint unions and ordinal sums,Proceedings of the AMS 45, No 2, pp. 295–299.

    Google Scholar 

  8. M. Zawadowski, Appendix to [2].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Warsaw, Poland

    Marek W. Zawadowski

Authors
  1. Marek W. Zawadowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Warsaw, Poland

    Michał Krynicki

  2. Department of Philosophy, University of Warsaw, Poland

    Marcin Mostowski

  3. Siedlce University, Poland

    Lesław W. Szczerba

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Zawadowski, M.W. (1995). Pre-Ordered Quantifiers in Elementary Sentences of Natural Language. In: Krynicki, M., Mostowski, M., Szczerba, L.W. (eds) Quantifiers: Logics, Models and Computation. Synthese Library, vol 249. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0524-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0524-0_13

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4540-9

  • Online ISBN: 978-94-017-0524-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation