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)
Authors
Jakub Szymanik
University of Amsterdam
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.
Keywords generalized quantifiers  computational complexity  reciprocal expressions  Strong Meaning Hypothesis
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 33,755
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-05-18

Total downloads
29 ( #206,945 of 2,263,140 )

Recent downloads (6 months)
2 ( #211,452 of 2,263,140 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature