Automorphisms of recursively saturated models of arithmetic (Q1182432)

The authors investigate the automorphism group of countable recursively saturated models of PA. For \(M\) a model of PA, \(Aut(M)\) is considered as a topological group where the topology is generated by the basic open subgroups \(G_{(a)} = \{ g\in Aut(M): g(a) = a\}\). They show that for any consistent complementation \(T\) of PA there are countable \(M_ 1,\;M_ 2\) of \(T\) with \(Aut(M_ 1)\not\cong Aut(M_ 2)\) as topological groups. The authors completely characterize the initial segments \(I\subset_ e M\) which are of the form \(I = \{ x\in M: g(x)=x\}\). All known facts about normal subgroups of \(Aut(M)\) are surveyed. It is shown that for \(M\models Th(\mathbb{N})\), \(H\) is a normal subgroup of \(M\) iff \(H=G_ A=\{ g\in Aut(M): g(a)=a\text{ for all }a\in A\}\) for some \(A\subseteq M\}\).