Automorphism groups of countable arithmetically saturated models of Peano arithmetic

DOI10.1017/JSL.2015.1MaRDI QIDQ2795926zbMATH OpenOpenAlexFDO

Authors James H. Schmerl

Publication date 22 March 2016

Published in The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.0772

zbMATH Keywords

automorphism groupPeano arithmeticrecursively saturated model

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Models with special properties (saturated, rigid, etc.) (03C50) Models of arithmetic and set theory (03C62) Infinite automorphism groups (20B27)

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.

Review text

The paper is devoted to the study of automorphism groups of models of arithmetic. The main results of it are connected with the following question: to what extent (the isomorphism type of) the group \(\mathrm{Aut}(\mathcal M)\) of all automorphisms of a countable recursively saturated model \(\mathcal M\) of Peano arithmetic PA determines (the isomorphism type of) \(\mathcal M\)? The principal result states that if \(\mathcal M\), \(\mathcal N\) are countable, arithmetically saturated models of PA and \(\mathrm{Aut}(\mathcal M) \simeq \mathrm{Aut} (\mathcal N)\) then the Turing-jumps of \(\mathrm{Th}(\mathcal M)\) and \(\mathrm{Th}(\mathcal N)\) are recursively equivalent. It is also proved that for each \(n < \omega\) there are recursively equivalent completions \(T_{0}, T_{1}, \ldots, T_{n}\) of PA such that whenever \(i < j \leq n\) and \(\mathcal M_i\), \(\mathcal M_j\) are countable arithmetically saturated models of \(T_{i}\) and \(T_{j}\), respectively, then \(\mathrm{Aut}(\mathcal M_i) \not\simeq \mathrm{Aut}(\mathcal M_j)\).

Recommendations

• More automorphism groups of countable, arithmetically saturated models of Peano arithmetic
• The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
• Automorphisms of countable recursively saturated models of PA: A survey
• On two questions concerning the automorphism groups of countable recursively saturated models of PA
• Decoding in the automorphism group of a recursively saturated model of arithmetic

Cites work

• Arithmetically saturated models of arithmetic
• Automorphisms of countable recursively saturated models of PA: A survey
• Automorphisms of recursively saturated models of arithmetic
• Computable structures and the hyperarithmetical hierarchy
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 638942 (Why is no real title available?)
• On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic
• Saturation and simple extensions of models of Peano arithmetic
• Subsystems of second order arithmetic
• The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
• The structure of models of Peano arithmetic

Cited in

(11)

• On two questions concerning the automorphism groups of countable recursively saturated models of PA
• More automorphism groups of countable, arithmetically saturated models of Peano arithmetic
• Automorphisms of countable recursively saturated models of PA: A survey
• Arithmetically saturated models of arithmetic
• Automorphism groups of saturated models of Peano arithmetic
• The Automorphism Group of a Countable Recursively Saturated Structure
• Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts
• Automorphism groups of models of Peano arithmetic
• The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
• Decoding in the automorphism group of a recursively saturated model of arithmetic
• Parametric groups of definable automorphisms of strongly constructive models

This page was built for publication: Automorphism groups of countable arithmetically saturated models of Peano arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795926)