A dichotomy in classifying quantifiers for finite models
From MaRDI portal
Publication:5486252
Abstract: We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called interpretability. We show that for every Q_R, ever Q_R is interpretable by quantifying over subsets of u and one to one functions on u both of bounded order, or the logic L(Q_R) (first order logic plus the quantifier Q_R) is undecidable.
Recommendations
Cites work
Cited in
(9)- A dichotomy result for Ramsey quantifiers
- Relativization of quantifiers in finite models
- The solution equivalence to general models for the RIM quantifier problem
- On quantification with a finite universe
- scientific article; zbMATH DE number 4039872 (Why is no real title available?)
- scientific article; zbMATH DE number 536900 (Why is no real title available?)
- scientific article; zbMATH DE number 218552 (Why is no real title available?)
- A Bicategorical Model for Finite Nondeterminism
- On representing concepts in finite models
This page was built for publication: A dichotomy in classifying quantifiers for finite models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486252)