The Computational Complexity of Quantified Reciprocals

In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer (2009)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-05-18

Downloads
44 (#361,171)

6 months
1 (#1,471,470)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jakub Szymanik
University of Amsterdam

Citations of this work

Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.

Add more citations

References found in this work

No references found.

Add more references