Axiomatizing universal properties of quantifiers
As defined in this paper, a (binary) quantifier \(Q\) associates to every model \(M\) a (binary) relation \(Q_ M\) over the powerset of \(M\). The meaning of \(M\models Qx(\varphi(x),\psi(x))\) is the same as \[ (\{m\in M\mid M\models\varphi[m]\},\;\{n\in M\mid M\models\psi[n]\})\in Q_ M. \] The author studies the first-order definability of properties of quantifiers. For instance, monotonicity of \(Q\) is expressible by the following universal sentence, written in a self-explanatory notation: \(\forall u\forall v\forall w(Q(u,v) \& v\subseteq w\to Q(u,w))\). An axiomatization is given of all quantifier properties that can be expressed by universal sentences.
- Unary quantifiers on finite models
- Directions in generalized quantifier theory
- Model theory of monadic predicate logic with the infinity quantifier
- Untestable Properties Expressible with Four First-Order Quantifiers
- A Simple Construction of Robinson Equivalence Relations
- Finite Axiomatizations for Universal Domains
- Self-commuting quantifiers
- scientific article; zbMATH DE number 5064944 (Why is no real title available?)
- Some results on quantifiers
This page was built for publication: Axiomatizing universal properties of quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985088)