Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic
From MaRDI portal
Publication:3807185
DOI10.2307/2047116zbMath0658.03022OpenAlexW4240669848MaRDI QIDQ3807185
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2047116
definabilitymodels of arithmeticmodels of set theorydefinable pointswell-founded modelundefinable class
Models of arithmetic and set theory (03C62) Models with special properties (saturated, rigid, etc.) (03C50) Interpolation, preservation, definability (03C40) Model-theoretic forcing (03C25)
Related Items (6)
The spectrum of elementary embeddings \(j: V \to V\) ⋮ Neutrally expandable models of arithmetic ⋮ ENAYAT MODELS OF PEANO ARITHMETIC ⋮ Models of set theory with definable ordinals ⋮ The wholeness axiom and Laver sequences ⋮ Minimal elementary extensions of models of set theory and arithmetic
Cites Work
- Classes on ZF models
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Conservative extensions of models of set theory and generalizations
- Blunt and topless end extensions of models of set theory
- On Certain Elementary Extensions of Models of Set Theory
- Forcing and Models of Arithmetic
- Models and types of Peano's arithmetic
- Hanf numbers for omitting types over particular theories
- End extensions and numbers of countable models
- Some applications of the notions of forcing and generic sets
This page was built for publication: Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic
