The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. We consider questions concerning the automorphism group of a countable recursively saturated model of PA. We prove new results concerning fixed point sets, open subgroups, and the cofinality of the automorphism group. We also prove that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of its elementary substructures.
"Arithmetically Saturated Models of Arithmetic." Notre Dame J. Formal Logic 36 (4) 531 - 546, Fall 1995. https://doi.org/10.1305/ndjfl/1040136914