Automorphism Groups of Countable Arithmetically Saturated Models of Peano Arithmetic
classification
🧮 math.LO
keywords
arithmeticarithmeticallycountablemodelspeanosaturatedautomorphismequivalent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.