The Computational Complexity of Quantified Reciprocals
Jakub Szymanik

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: reciprocal expressions, computational complexity,
generalized quantifiers, Strong Meaning Hypothesis