Abstract
There is an infinite set of Turing-equivalent completions of Peano Arithmetic () such that whenever and are nonisomorphic countable, arithmetically saturated models of and , , then .
Citation
James H. Schmerl. "More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic." Notre Dame J. Formal Logic 59 (4) 491 - 496, 2018. https://doi.org/10.1215/00294527-2018-0009
Information