Saturation and simple extensions of models of Peano arithmetic (Q762144)

If e is an element of a model M of PA, then M is called e-lofty if for every recursive type t(v) with a finite number of parameters from M, if t(v) is finitely realizable in M then so is the type t(v)\(\cup \{v\in S\}\) for some \(S\in M\) of size e (in M). A model M is lofty if it is e- lofty for some e in M. It is shown that, at least for countable models, the lofty models are precisely those models which have recursively saturated simple extensions. The lofty models form an intermediate class between tall models and recursively saturated models. A sharp version of this result is given by showing that if I is an initial segment of M closed under multiplication then there is an elementary extension N of M such that I is the set of those elements of N for which N is not e-lofty. Various notions of loftiness and relations between them are considered. It is also shown that (unlike recursively saturated models) lofty models do not form a \(PC^*_{\delta}\) class. All the results have their bounded (short) versions. The paper is concluded by a list of problems concerning uncountable lofty models.