A remark on collective quantification
From MaRDI portal
Publication:1006495
DOI10.1007/s10849-007-9055-0zbMath1162.03313OpenAlexW2153365206MaRDI QIDQ1006495
Publication date: 24 March 2009
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10849-007-9055-0
Computational complexityLindström quantifiersCollective quantificationDefinabilitySecond-order generalized quantifiersType-shifting
Related Items (4)
A characterization of definability of second-order generalized quantifiers with applications to non-definability ⋮ Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents ⋮ On the identification of quantifiers' witness sets: a study of multi-quantifier sentences ⋮ Distributivity, collectivity, and cumulativity in terms of (in)dependence and maximality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational complexity of the semantics of some natural language constructions
- Extensions of MSO and the monadic counting hierarchy
- Definability of second order generalized quantifiers
- Language in action. Categories, lambdas and dynamic logic
- The polynomial-time hierarchy
- Definability of polyadic lifts of generalized quantifiers
- On second-order generalized quantifiers and finite structures
- Monotonicity and collective quantification
- PP is as Hard as the Polynomial-Time Hierarchy
- LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY
This page was built for publication: A remark on collective quantification