Skip to main content
SpringerLink
Log in

The Computational Complexity of Quantified Reciprocals

  • Conference paper
Logic, Language, and Computation (TbiLLC 2007)

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

Included in the following conference series:

Abstract

We study the computational complexity of reciprocal sentences with quantified antecedents. We observe a computational dichotomy between different interpretations of reciprocity, and shed some light on the status of the so-called Strong Meaning Hypothesis.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Heim, I., Lasnik, H., May, R.: Reciprocity and plurality. Linguistic Inquiry 22, 63–101 (1991)

    Google Scholar 

  2. Beck, S.: The semantics of different: Comparison operator and relational adjective. Linguistics and Philosophy 23, 101–139 (2000)

    Article  Google Scholar 

  3. Sabato, S., Winter, Y.: From semantic restrictions to reciprocal meanings. In: Proceedings of FG-MOL 2005. CSLI Publications (2005)

    Google Scholar 

  4. Dalrymple, M., Kanazawa, M., Kim, Y., Mchombo, S., Peters, S.: Reciprocal expressions and the concept of reciprocity. Linguistics and Philosophy 21, 159–210 (1998)

    Article  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  6. Lindström, P.: First order predicate logic with generalized quantifiers. Theoria 32, 186–195 (1966)

    MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Peters, S., Westerståhl, D.: Quantifiers in Language and Logic. Clarendon Press, Oxford (2006)

    Google Scholar 

  9. Winter, Y.: Flexibility principles in Boolean semantics. The MIT Press, London (2001)

    MATH  Google Scholar 

  10. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1993)

    MATH  Google Scholar 

  11. Blass, A., Gurevich, Y.: Henkin quantifiers and complete problems. Annals of Pure and Applied Logic 32, 1–16 (1986)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  14. Otto, M.: Bounded Variable Logics and Counting, vol. 9. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  15. Grädel, E., Gurevich, Y.: Metafinite model theory. Information and Computation 140, 26–81 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  16. Mostowski, M., Szymanik, J.: Computational complexity of some Ramsey quantifiers in finite models. The Bulletin of Symbolic Logic 13, 281–282 (2007)

    Google Scholar 

  17. Väänänen, J.: Unary quantifiers on finite models. Journal of Logic, Language and Information 6, 275–304 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  19. Frege, G.: Über Sinn und Bedeutung. Zeitschrift für Philosophie und philosophische Kritik 100, 25–50 (1892)

    Google Scholar 

  20. Moschovakis, Y.: A logical calculus of meaning and synonymy. Linguistics and Philosophy 29, 27–89 (2006)

    Article  Google Scholar 

  21. Cherniak, C.: Minimal rationality. Mind 90, 161–183 (1981)

    Article  Google Scholar 

  22. Levesque, H.J.: Logic and the complexity of reasoning. Journal of Philosophical Logic 17, 355–389 (1988)

    Article  MathSciNet  Google Scholar 

  23. van Rooij, I.: The tractable cognition thesis. Cognitive Science: A Multidisciplinary Journal 32, 939–984 (2008)

    Article  Google Scholar 

  24. Ristad, E.S.: The Language Complexity Game (Artificial Intelligence). The MIT Press, Cambridge (1993)

    Google Scholar 

  25. Mostowski, M., Szymanik, J.: Semantic bounds for everyday language. Technical Report ILLC Preprint Series, PP-2006-40, Institute for Logic, Language and Computation, University of Amsterdam (2005) (to appear in Semiotica)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  28. Szymanik, J.: A comment on a neuroimaging study of natural language quantifier comprehension. Neuropsychologia 45, 2158–2160 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Logic, Language and Computation, University of Amsterdam, Valckenierstraat 65, 1018 XE, Amsterdam, The Netherlands

    Jakub Szymanik

  2. Institute of Philosophy, University of Warsaw, Poland

    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. Institut für Kognitionswissenschaft, Universität Osnabrück, 49069, Osnabrück, Germany

    Peter Bosch

  2. Razmadze Mathematical Institute, 1 Aleksidze st., 0193, Tbilisi, Georgia

    David Gabelaia

  3. LAMSADE, Université Paris-Dauphine, 75775, Paris Cedex 16, France

    Jérôme Lang

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szymanik, J. (2009). The Computational Complexity of Quantified Reciprocals. In: Bosch, P., Gabelaia, D., Lang, J. (eds) Logic, Language, and Computation. TbiLLC 2007. Lecture Notes in Computer Science(), vol 5422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00665-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00665-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00664-7

  • Online ISBN: 978-3-642-00665-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation