Pointwise definable substructures of models of Peano arithmetic (Q1113901)

This paper investigates the submodels of a model M of PA, whose domain is composed of points definable by nonstandard formulas, or initial segments generated by such submodels. The paper makes use of the notion of satisfaction class due to \textit{S. Krajewski} [Lect. Notes Math. 537, 121-144 (1976; Zbl 0338.02030)]. Assume that M is a countable model of PA and S is a full substitutable satisfaction class on M. An initial segment I of M is closed if it is closed under logical operation (in then sense of M). A closed I gives rise to a substructure D(I), composed of those elements of M definable by nonstandard formulas belonging to I with parameters from I. \(M^{D(I)}\) will denote the initial segment generated by I. Results: 1) There are \(2^{\aleph_ 0}\) closed initial segments. 2) If \(\omega\) noncodes I in M then D(I) and \(M^{D(I)}\) are recursively saturated. 3) There are \(2^{\aleph_ 0}\) structures of the form D(I) or of the form \(M^{D(I)}\). Also the case in which definability involves a parameter \(a>I\) is considered.