Unary quantifiers on finite models
From MaRDI portal
Publication:1361404
Recommendations
Cited in
(20)- scientific article; zbMATH DE number 2144731 (Why is no real title available?)
- Hierarchies of monadic generalized quantifiers
- Relational structures constructible by quantifier free definable operations
- The Computational Complexity of Quantified Reciprocals
- Characterizing polynomial Ramsey quantifiers
- Random unary predicates: Almost sure theories and countable models
- scientific article; zbMATH DE number 536900 (Why is no real title available?)
- A dichotomy result for Ramsey quantifiers
- Counting modulo quantifiers on finite structures
- A dichotomy in classifying quantifiers for finite models
- Quantifiers determined by partial orderings
- Some results on quantifiers
- On the expressive power of monotone natural language quantifiers over finite models
- Model-complete theories of bounded unars
- Model theory of monadic predicate logic with the infinity quantifier
- A note on the monotonicity of reducible quantifiers
- Game-based notions of locality over finite models
- On probabilistic elimination of generalized quantifiers
- Quantifiers in limits
- Relativization of quantifiers in finite models
This page was built for publication: Unary quantifiers on finite models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361404)