3 research outputs found
The computational complexity of quantified reciprocals
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
The Computational Complexity of Quantified Reciprocals
We study the computational complexity of reciprocal sentences with quanti ed 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