The Computational Complexity of Quantified Reciprocals

DOI10.1007/978-3-642-00665-4_12zbMath1236.68277OpenAlexW2149670146MaRDI QIDQ3623832

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

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