2000 character limit reached
Automorphism Groups of Countable Arithmetically Saturated Models of Peano Arithmetic
Published 4 Nov 2013 in math.LO | (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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.