Resplendent models and \({\Sigma_1^1}\)-definability with an oracle
From MaRDI portal
Publication:944221
DOI10.1007/s00153-008-0100-8zbMath1160.03009MaRDI QIDQ944221
Publication date: 12 September 2008
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-008-0100-8
dense linear order; recursively saturated model; arithmetised completeness theorem; discrete linear order; internalization into PA model; Pabion's theorem; resplendency; resplendent model
03C62: Models of arithmetic and set theory
03C50: Models with special properties (saturated, rigid, etc.)
03C07: Basic properties of first-order languages and structures
03C30: Other model constructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Order-types of models of arithmetic and a connection with arithmetic saturation
- Finite Axiomatizability using additional predicates
- Large resplendent models generated by indiscernibles
- Nonstandard characterizations of recursive saturation and resplendency
- Saturated models of Peano arithmetic
- One hundred and two problems in mathematical logic
- An introduction to recursively saturated and resplendent models
- Models with compactness properties relative to an admissible language