scientific article; zbMATH DE number 1163948
From MaRDI portal
Publication:4395572
The problem of the definability and the eliminability of the generalized quantifier \(Q\) (\(Qx=\) ``there exist uncountably many \(x\)) is considered. It is shown that a significant part of the model theory of logic with the quantifier \(Q\) is reducible to the model theory of first-order logic with an exra binary relation. The introduced technique is used to study \(\omega_1\)-like models of Peano arithmetic and to give a simple proof of Vaught's two-cardinal theorem \((k^+,k)\to (\omega_1,\omega_0)\). For the entire collection see [Zbl 0885.00035].
Recommendations
- On the definability of the quantifier there exist uncountably many
- Algebraic analysis of the logic with the quantifier there exist uncountably many
- scientific article; zbMATH DE number 45180
- scientific article; zbMATH DE number 4043829
- Expressing cardinality quantifiers in monadic second-order logic over chains
Cited in
(10)- On the definability of the quantifier there exist uncountably many
- Algebraic analysis of the logic with the quantifier there exist uncountably many
- A model and its subset: The uncountable case
- Characterizing all models in infinite cardinalities
- Quantifiers in limits
- scientific article; zbMATH DE number 4043829 (Why is no real title available?)
- scientific article; zbMATH DE number 45180 (Why is no real title available?)
- Sur l'existence de modèles du second ordre non dénombrables avec domaine du premier ordre dénombrable
- On the elimination of Malitz quantifiers over Archimedian real closed fields
- Languages with finite string of quantifiers on uncountable structures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395572)