A remark on collective quantification
DOI10.1007/S10849-007-9055-0zbMATH Open1162.03313OpenAlexW2153365206MaRDI QIDQ1006495FDOQ1006495
Authors: Juha Kontinen, Jakub Szymanik 
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
Recommendations
- Monotonicity and collective quantification
- scientific article; zbMATH DE number 3135821
- scientific article; zbMATH DE number 3316881
- Collective assertions
- Observations on Quantit Analysis
- scientific article; zbMATH DE number 4202214
- scientific article; zbMATH DE number 66653
- On a quantitative notion of uniformity
Computational complexity[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Lindstr%EF%BF%BD%EF%BF%BDm+quantifiers&go=Go Lindstr��m quantifiers]Collective quantificationDefinabilitySecond-order generalized quantifiersType-shifting
Cites Work
- Title not available (Why is that?)
- The polynomial-time hierarchy
- On second-order generalized quantifiers and finite structures
- PP is as Hard as the Polynomial-Time Hierarchy
- Lindström quantifiers and leaf language definability
- Extensions of MSO and the monadic counting hierarchy
- Definability of second order generalized quantifiers
- Language in action. Categories, lambdas and dynamic logic
- Monotonicity and collective quantification
- Henkin quantifiers: logic, games, and computation.
- Computational complexity of the semantics of some natural language constructions
- Title not available (Why is that?)
- Definability of polyadic lifts of generalized quantifiers
Cited In (8)
- Distributivity, collectivity, and cumulativity in terms of (in)dependence and maximality
- A characterization of monotonicity with collective quantifiers
- Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents
- Monotonicity and collective quantification
- A quantitative discursive dilemma
- Parallel quantification
- A characterization of definability of second-order generalized quantifiers with applications to non-definability
- On the identification of quantifiers' witness sets: a study of multi-quantifier sentences
This page was built for publication: A remark on collective quantification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006495)
