Resplendent models and \({\Sigma_1^1}\)-definability with an oracle

DOI10.1007/S00153-008-0100-8zbMath1160.03009OpenAlexW2077933886MaRDI QIDQ944221

Andrey Bovykin

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

zbMATH Keywords

dense linear orderrecursively saturated modelarithmetised completeness theoremdiscrete linear orderinternalization into PA modelPabion's theoremresplendencyresplendent model

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Models with special properties (saturated, rigid, etc.) (03C50) Basic properties of first-order languages and structures (03C07) Other model constructions (03C30)

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

This page was built for publication: Resplendent models and \({\Sigma_1^1}\)-definability with an oracle