Automorphisms of models of arithmetic: a unified view (Q866555): Difference between revisions

The unification referred to in the title concerns a general framework for iterated ultrapower constructions over models of arithmetic. Enayat develops a general method which combines features of the Skolem-Gaifman ultrapowers using definable functions, and Kirby-Paris ultrapowers utilizing coded functions defined on initial segments. Using his technique, Enayat gives proofs of some known results on automorohisms of countable recursively saturated models of PA and proves some new theorems. The new proofs are simpler and the statements sharper. For example, it is shown in [\textit{R. Kaye, R. Kossak} and \textit{H. Kotlarski}, ``Automorphisms of recursively saturated models of arithmetic'', Ann. Pure Appl. Logic 55, 67--99 (1991; Zbl 0748.03023)] that every countable arithmetically saturated model of PA has an automorphism moving all undefinable elements. The proof is based on a rather delicate back-and-forth construction. Enayat's proof is simpler, and in addition gives the following: if \(M\) is a countable arithmetically saturated model of PA, then there is a group embedding \(j\mapsto\widehat j\) from the group of order-preserving permutations of the rational numbers into \(\Aut(M)\) such that for each \(j\) in \(\Aut(Q,<)\) which is fixed point-free, \(\widehat j\) moves every undefinable element of \(M\). The main new result is a confirmation of the following long-standing conjecture of Jim Schmerl: Let \(M\) be a countable arithmetically saturated model of PA, and let \(K\) be an elementary submodel of \(M\). Then \(M\) has an automorphism \(f\) such that the submodel of \(M\) consisting of the elements fixed by \(f\) is isomorphic to \(K\).