Skip to main content
SpringerLink
Log in
Book cover

Conference on Mathematics of Language

Conference on Mathematics of Language

MOL 2009, MOL 2007: The Mathematics of Language pp 272–280Cite as

Almost All Complex Quantifiers Are Simple

  • Conference paper

  • 641 Accesses

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

Abstract

We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption.

This is a preview of subscription content, 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   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. Peters, S., Westerståhl, D.: Quantifiers in Language and Logic. Clarendon Press, Oxford (2006)

    Google Scholar 

  2. van Benthem, J.: Essays in logical semantics. Reidel, Dordrecht (1986)

    MATH  Google Scholar 

  3. Mostowski, M.: Computational semantics for monadic quantifiers. Journal of Applied Non-Classical Logics 8, 107–121 (1998)

    MATH  MathSciNet  Google Scholar 

  4. McMillan, C.T., Clark, R., Moore, P., Devita, C., Grossman, M.: Neural basis for generalized quantifier comprehension. Neuropsychologia 43, 1729–1737 (2005)

    Article  Google Scholar 

  5. Szymanik, J., Zajenkowski, M.: Comprehension of simple quantifiers. Empirical evaluation of a computational model. Cognitive Science 34(3), 521–532 (2010)

    Article  Google Scholar 

  6. Mostowski, M., Wojtyniak, D.: Computational complexity of the semantics of some natural language constructions. Annals of Pure and Applied Logic 127(1-3), 219–227 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Sevenster, M.: Branches of imperfect information: logic, games, and computation. PhD thesis, Universiteit van Amsterdam (2006)

    Google Scholar 

  8. Szymanik, J.: Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language. PhD thesis, Universiteit van Amsterdam (2009)

    Google Scholar 

  9. Gierasimczuk, N., Szymanik, J.: Branching quantification vs. two-way quantification. Journal of Semantics 26(4), 367–392 (2009)

    Article  Google Scholar 

  10. Szymanik, J.: The computational complexity of quantified reciprocals. In: Bosch, P., Gabelaia, D., Lang, J. (eds.) LNCS (LNAI), vol. 5422, pp. 139–152. Springer, Heidelberg (2008)

    Google Scholar 

  11. Kontinen, J., Szymanik, J.: A remark on collective quantification. Journal of Logic, Language and Information 17(2), 131–140 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Frixione, M.: Tractable competence. Minds and Machines 11(3), 379–397 (2001)

    Article  MATH  Google Scholar 

  13. Immerman, N.: Descriptive Complexity. In: Texts in Computer Science, Springer, Heidelberg (1998)

    Google Scholar 

  14. Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (November 1993)

    Google Scholar 

  15. van Benthem, J.: Polyadic quantifiers. Linguistics and Philosophy 12(4), 437–464 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. Hella, L., Väänänen, J., Westerståhl, D.: Definability of polyadic lifts of generalized quantifiers. Journal of Logic, Language and Information 6(3), 305–335 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, Utrecht University, Heidelberglaan 6, 3584, CS, Utrecht, The Netherlands

    Jakub Szymanik

Authors
  1. Jakub Szymanik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Linguistics, University of Tuebingen, Wilhelmstrasse 19, 72074, Tuebingen, Germany

    Christian Ebert  & Gerhard Jäger  & 

  2. Faculty of Linguistics and Literary Studies, University of Bielefeld, Postfach 100131, 33501, Bielefeld, Germany

    Jens Michaelis

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szymanik, J. (2010). Almost All Complex Quantifiers Are Simple. In: Ebert, C., Jäger, G., Michaelis, J. (eds) The Mathematics of Language. MOL MOL 2009 2007. Lecture Notes in Computer Science(), vol 6149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14322-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14322-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14321-2

  • Online ISBN: 978-3-642-14322-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation