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 / Szymanik, J.. - 5422:(2009), pp. 139-152. ( 7th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2007 Tbilisi 2009) [10.1007/978-3-642-00665-4_12].
The computational complexity of quantified reciprocals
Szymanik, J.
2009-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
