Nonstandard characterizations of recursive saturation and resplendency
From MaRDI portal
Publication:3786482
DOI10.2307/2274370zbMath0644.03039OpenAlexW4235003223MaRDI QIDQ3786482
Publication date: 1987
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274370
Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Models with special properties (saturated, rigid, etc.) (03C50)
Related Items
Nonstandard definability, Resplendent models and \({\Sigma_1^1}\)-definability with an oracle, Interpreting the compositional truth predicate in models of arithmetic