Nonstandard characterizations of recursive saturation and resplendency

DOI10.2307/2274370zbMath0644.03039OpenAlexW4235003223MaRDI QIDQ3786482

Stuart T. Smith

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

zbMATH Keywords

arithmetical complexityrecursive saturationnonstandard modelsatisfaction classresplendent model

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Models with special properties (saturated, rigid, etc.) (03C50)

Related Items (3)

Nonstandard definability ⋮ Resplendent models and \({\Sigma_1^1}\)-definability with an oracle ⋮ Interpreting the compositional truth predicate in models of arithmetic

This page was built for publication: Nonstandard characterizations of recursive saturation and resplendency