Order-types of models of arithmetic and a connection with arithmetic saturation (Q1888631)

The paper contains three results concerning resplendent models of Peano arithmetic, their order types, standard systems and automorphisms. For an ordered set \(A\), lcf\((A)\), the lower cofinality of \(A\), is the cofinality of the reversed order \(A^*\). The three results are: 1. If \(M\models \text{PA}\) is resplendent and lcf\((M\setminus\omega)\) is uncountable, then for all \(n\in \omega\) the reduct of \(M\) to the ordering is expandable to the \(\Pi_n\) theory of the standard model. As a corollary this gives that if \(T\) is any consistent arithmetic theory extending PA, \(M\models \text{PA}\) is resplendent and lcf\((M\setminus\omega)\) is uncountable; then there is \(N\models T\) such that the reducts of \(M\) and \(N\) to the orderings are isomorphic. 2. Let \(X\) be a countable Scott set. Then \(X\) is closed under jump if and only if there is a recursively saturated model \(M\models \text{PA}\) such that lcf\((M\setminus\omega)\) is uncountable and the standard system of \(M\) is \(X\). 3. Let \(M\) be a countable arithmetically saturated model of PA. By the results from \textit{R. Kaye, R. Kossak} and \textit{H. Kotlarski} [Ann. Pure Appl. Logic 55, 67--99 (1991; Zbl 0748.03023)] and \textit{R. Kossak} and \textit{J. H. Schmerl} [Notre Dame J. Formal Logic 36, No. 4, 531--546 (1995; Zbl 0848.03017)], if \(M\) is an elementary extension of the standard model, then there is an automorphism \(f\) of \(M\) such that, for all nonstandard \(x\), \(f(x)>x\). If \(M\) is not an elementary extension of the standard model then there can be no such \(f\) but there is an \(f\) such that \(f(x)\not= x\), for all undefinable \(x\), and also there is an \(f\) such that \(f(x)>x\) for all \(x\) larger than all the definable elements of \(M\). Let \(E\) be the set of the nonstandard elements of \(M\) which are smaller than all nonstandard definable elements of \(M\) (if \(M\) is arithmetically saturated and has nonstandard definable elements, \(E\) is nonempty). The author generalizes the results stated above by showing that if \(M\) has nonstandard definable elements, then \(M\) has an automorphism \(f\) such that for all \(x\in E\), \(f(x)>x\) and \(f\) moves all nondefinable elements of \(M\).