The Computational Complexity of Quantified Reciprocals
From MaRDI portal
Publication:3623832
DOI10.1007/978-3-642-00665-4_12zbMath1236.68277MaRDI QIDQ3623832
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
computational complexity; generalized quantifiers; reciprocal expressions; Strong Meaning Hypothesis
68Q25: Analysis of algorithms and problem complexity
03B65: Logic of natural languages
68T50: Natural language processing
Cites Work
- Computational complexity of the semantics of some natural language constructions
- Henkin quantifiers and complete problems
- Unary quantifiers on finite models
- Definability of polyadic lifts of generalized quantifiers
- Metafinite model theory
- On a generalization of quantifiers
- Generalized quantifiers and natural language
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item