The Computational Complexity of Quantified Reciprocals

DOI10.1007/978-3-642-00665-4_12MaRDI QIDQ3623832zbMATH OpenOpenAlexFDO

Authors Jakub Szymanik

Publication date 24 April 2009

Published in Logic, Language, and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00665-4_12

zbMATH Keywords

computational complexitygeneralized quantifiersreciprocal expressionsStrong Meaning Hypothesis

Mathematics Subject Classification ID

Logic of natural languages (03B65) Analysis of algorithms and problem complexity (68Q25) Natural language processing (68T50)

Recommendations

• Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents
• Computational complexity of the semantics of some natural language constructions
• More fragments of language.
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
• The anaphora problem

Cites work

• Computational complexity of the semantics of some natural language constructions
• Definability of polyadic lifts of generalized quantifiers
• Generalized quantifiers and natural language
• Henkin quantifiers and complete problems
• Henkin quantifiers: logic, games, and computation.
• scientific article; zbMATH DE number 6003856 (Why is no real title available?)
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 1734460 (Why is no real title available?)
• scientific article; zbMATH DE number 979011 (Why is no real title available?)
• Metafinite model theory
• On a generalization of quantifiers
• Tractable competence
• Unary quantifiers on finite models

Cited in

(1)

• Internal reading and reciprocity

This page was built for publication: The Computational Complexity of Quantified Reciprocals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623832)