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
Cites work
- scientific article; zbMATH DE number 6003856 (Why is no real title available?)
- scientific article; zbMATH DE number 1734460 (Why is no real title available?)
- Computational complexity of the semantics of some natural language constructions
- Definability of polyadic lifts of generalized quantifiers
- Definability of second order generalized quantifiers
- Extensions of MSO and the monadic counting hierarchy
- Henkin quantifiers: logic, games, and computation.
- Language in action. Categories, lambdas and dynamic logic
- Lindström quantifiers and leaf language definability
- Monotonicity and collective quantification
- On second-order generalized quantifiers and finite structures
- PP is as Hard as the Polynomial-Time Hierarchy
- The polynomial-time hierarchy
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)
