Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets (Q4372852)

The most important notions used in this paper, like fixed point set \(\text{fix}(\alpha)\) of an automorphism \(\alpha\) of a countable recursively saturated model \(M\) of Peano Arithmetic (PA), elementary cut of \(M\), standard system of \(M\), are defined in the introduction. In the second part, the author gives a survey of known results on fixed submodels and their characterization. Moreover, the following two facts are proved: Every fixed submodel of a countable recursively saturated model \(M\) of PA, which is not arithmetically saturated, is isomorphic to \(M\). Each countable model of PA is isomorphic to a fixed subset of a countable arithmetically saturated model of PA. The third section deals with minimal types. It was shown that every rcursively saturated model of PA realizes infinitely many pairwise independent minimal types. Using the notions of Skolem closure of a subset of \(M\) and the gap of an element of \(M\), the author presents certain properties of minimal types. The main result is proved in the fourth section: Let \(\{c_i: i\in\omega\}\) be a cofinal subset of a countable arithmetically saturated model \(M\) of PA such that for every \(i\), \(\text{gap}(c_i)< \text{gap}(c_{i+ 1})\), and every \(c_i\) realizes a minimal type. Then there is an automorphism \(\alpha\) of \(M\) such that \(\text{fix}(\alpha)= H(\{c_i: i\in\Omega\})\). A consequence of this theorem is the fact that each countable arithmetically saturated model of PA has continuum many nonisomorphic fixed submodels.