PP-2008-43: Szymanik, Jakub (2008) The Computational Complexity of Quantified Reciprocals. [Report]
Preview |
Text (Full Text)
PP-2008-43.text.pdf Download (243kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2008-43.abstract.txt Download (449B) |
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.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2008-43 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2008 |
| Uncontrolled Keywords: | reciprocal expressions, computational complexity, generalized quantifiers, Strong Meaning Hypothesis |
| Subjects: | Computation |
| Date Deposited: | 12 Oct 2016 14:37 |
| Last Modified: | 12 Oct 2016 14:37 |
| URI: | https://eprints.illc.uva.nl/id/eprint/317 |
Actions (login required)
 |
View Item |
