The computational complexity of quantified reciprocals

Authors
Publication date 2009
Host editors
  • P. Bosch
  • D. Gabelaia
  • J. Lang
Book title Logic, Language, and Computation
Book subtitle 7th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2007, Tbilisi, Georgia, October 1-5, 2007 : revised selected papers
ISBN
  • 9783642006647
ISBN (electronic)
  • 9783642006654
Series Lecture Notes in Computer Science
Event 7th International Tbilisi Symposium on Logic, Language, and Computation (TbiLLC 2007), Tbilisi, Georgia
Pages (from-to) 139-152
Publisher Berlin: Springer
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
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.
Document type Conference contribution
Language English
Published at https://doi.org/10.1007/978-3-642-00665-4_12
Permalink to this page
Back