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

The author presents a new approach to resplendency. Namely, this external model-theoretic property is related to partly internal ones, such as strong interpretability in a model \(M\models\text{PA}+(\Pi_1\)-theory of \(\mathbb{N})\), by carrying out model-theoretic constructions, like completeness, in \(M\). A germ of the idea is in \textit{S. C. Kleene}'s paper [Mem. Am. Math. Soc. 10, 27--68 (1952; Zbl 0047.25001)], which states (roughly) that the infinitary conjunction of an r.e. set of formulas can be expressed by a single formula with extra predicates. (And, resplendency is about the realizability of consistent extra predicates.) The author emphasizes that ``the main value of the article is in its methods'', but there are a number of results, problems, and further refinements of notions. For instance, the rational numbers (with the usual order) of a model of \(\text{PA}+(\Pi_1\text{-Th}(\mathbb{N}))\) is shown to be resplendent. Three versions of chronical resplendency are given, and their relations in various situations are open problems. The author gives detailed investigations into dense [discrete] linear orders. These are not just special cases, because saturation and resplendency of models are decided by their orders. Cf. \textit{J. F. Pabion}'s paper [J. Symb. Log. 47, 625--637 (1982; Zbl 0498.03021)]. Work is extended to more general treatable and categorically treatable theories.