Automorphism Groups of Countable Arithmetically Saturated Models of Peano Arithmetic
Logic
2014-02-25 v3
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.
Keywords
Cite
@article{arxiv.1311.0772,
title = {Automorphism Groups of Countable Arithmetically Saturated Models of Peano Arithmetic},
author = {James H. Schmerl},
journal= {arXiv preprint arXiv:1311.0772},
year = {2014}
}
Comments
This version is a complete revision of the previous version. The main result of this version greatly improves the main result of the earlier version