Automorphism Groups of Countable Arithmetically Saturated Models of Peano Arithmetic (1311.0772v3)

Abstract: If M,N are countable, arithmetically saturated models of Peano Arithmetic and Aut(M) is isomorphic to Aut(N), then the Turing-jumps of Th(M) and Th(N) are recursively equivalent.