In this paper we investigate the properties of automorphism groups of countable short recursively saturated models of arithmetic. In particular, we show that Kaye's Theorem concerning the closed normal subgroups of automorphism groups of countable recursively saturated models of arithmetic applies to automorphism groups of countable short recursively saturated models as well. That is, the closed normal subgroups of the automorphism group of a countable short recursively saturated model of PA are exactly the stabilizers of the invariant cuts of the (...) model which are closed under exponentiation. This Galois correspondence is used to show that there are countable short recursively saturated models of arithmetic whose automorphism groups are not isomorphic as topological groups. Moreover, we show that the automorphism groups of countable short arithmetically saturated models of PA are not topologically isomorphic to the automorphism groups of countable short recursively saturated models of PA which are not short arithmetically saturated. (shrink)

There is an infinite set T of Turing-equivalent completions of Peano Arithmetic such that whenever M and N are nonisomorphic countable, arithmetically saturated models of PA and Th, Th∈T, then Aut≇Aut.

In this paper we study the automorphism groups of models of Peano Arithmetic. Kossak, Kotlarski, and Schmerl [9] shows that the stabilizer of an unbounded element a of a countable recursively saturated model of Peano Arithmetic M is a maximal subgroup of Aut if and only if the type of a is selective. We extend this result by showing that if M is a countable arithmetically saturated model of Peano Arithmetic, Ω ⊂ M is a very good interstice, and a (...) ∈ Ω, then the stabilizer of a is a maximal subgroup of Aut if and only if the type of a is selective and rational. (shrink)

We discuss automorphisms of saturated models of PA and boundedly saturated models of PA. We show that Smoryński's Lemma and Kaye's Theorem are not only true for countable recursively saturated models of PA but also true for all boundedly saturated models of PA with slight modifications.

In this paper we discuss automorphism groups of saturated models and boundedly saturated models of $\mathsf{PA}$. We show that there are saturated models of $\mathsf{PA}$ of the same cardinality with nonisomorphic automorphism groups. We then show that every saturated model of $\mathsf{PA}$ has short saturated elementary cuts with nonisomorphic automorphism groups.

The main result of this paper partially answers a question raised in about the existence of countable just recursively saturated models of Peano Arithmetic with non‐isomorphic automorphism groups. We show the existence of infinitely many countable just recursively saturated models of Peano Arithmetic such that their automorphism groups are not topologically isomorphic. We also discuss maximal open subgroups of the automorphism group of a countable arithmetically saturated model of in a very good interstice.