Automorphisms of recursively saturated models of arithmetic
From MaRDI portal
The authors investigate the automorphism group of countable recursively saturated models of PA. For \(M\) a model of PA, \(Aut(M)\) is considered as a topological group where the topology is generated by the basic open subgroups \(G_{(a)} = \{ g\in Aut(M): g(a) = a\}\). They show that for any consistent complementation \(T\) of PA there are countable \(M_ 1,\;M_ 2\) of \(T\) with \(Aut(M_ 1)\not\cong Aut(M_ 2)\) as topological groups. The authors completely characterize the initial segments \(I\subset_ e M\) which are of the form \(I = \{ x\in M: g(x)=x\}\). All known facts about normal subgroups of \(Aut(M)\) are surveyed. It is shown that for \(M\models Th(\mathbb{N})\), \(H\) is a normal subgroup of \(M\) iff \(H=G_ A=\{ g\in Aut(M): g(a)=a\text{ for all }a\in A\}\) for some \(A\subseteq M\}\).
Recommendations
- Automorphisms of saturated and boundedly saturated models of arithmetic
- Automorphisms of models of bounded arithmetic
- scientific article; zbMATH DE number 2144534
- Automorphisms of models of arithmetic: a unified view
- Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets
- Automorphism groups of arithmetically saturated models
- ON AUTOMORPHISMS OF RESPLENDENT MODELS OF ARITHMETIC
- On M-recursively saturated models of arithmetic
- Results on automorphisms of recursively saturated models of PA
- Automorphisms of countable recursively saturated models of PA: A survey
Cites work
- ω1-like recursively saturated models of Presburger's arithmetic
- A Note on Real Subsets of A Recursively Saturated Model
- Discernible elements in models for Peano arithmetic
- scientific article; zbMATH DE number 4010521 (Why is no real title available?)
- scientific article; zbMATH DE number 3745167 (Why is no real title available?)
- scientific article; zbMATH DE number 3792159 (Why is no real title available?)
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 3566838 (Why is no real title available?)
- scientific article; zbMATH DE number 4121974 (Why is no real title available?)
- scientific article; zbMATH DE number 3372013 (Why is no real title available?)
- Infinite permutation groups. II: Subgroups of small index
- Minimal satisfaction classes with an application to rigid models of Peano arithmetic
- Models and types of Peano's arithmetic
- Models with the ω-property
- On cofinal extensions of models of arithmetic
- On elementary cuts in models of arithmetic
- On elementary cuts in recursively saturated models of Peano Arithmetic
- Recursively saturated \(\omega _ 1\)-like models of arithmetic
- Recursively saturated models generated by indiscernibles
- Recursively saturated nonstandard models of arithmetic
- Results on automorphisms of recursively saturated models of PA
- Some remarks on initial segments in models of Peano arithmetic
- The Automorphism Group of a Countable Recursively Saturated Structure
- Toward model theory through recursive saturation
Cited in
(35)- Automorphisms of countable short recursively saturated models of PA
- On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
- Automorphisms of models of true arithmetic: Recognizing some basic open subgroups
- Infinitary definitions of equivalence relations in models of PA
- More automorphism groups of countable, arithmetically saturated models of Peano arithmetic
- Iterated ultrapowers for the masses
- Fixed points of self-embeddings of models of arithmetic
- Transplendent models: expansions omitting a type
- Automorphisms of countable recursively saturated models of PA: A survey
- Four problems concerning recursively saturated models of arithmetic
- Arithmetically saturated models of arithmetic
- Automorphism groups of countable arithmetically saturated models of Peano arithmetic
- The complexity of classification problems for models of arithmetic
- Recursively saturated nonstandard models of arithmetic; addendum
- Interstitial and pseudo gaps in models of Peano arithmetic
- A Galois correspondence for countable short recursively saturated models of PA
- Results on automorphisms of recursively saturated models of PA
- The Automorphism Group of a Countable Recursively Saturated Structure
- Automorphisms moving all non-algebraic points and an application to NF
- Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely
- scientific article; zbMATH DE number 663792 (Why is no real title available?)
- scientific article; zbMATH DE number 663795 (Why is no real title available?)
- scientific article; zbMATH DE number 663796 (Why is no real title available?)
- Automorphism groups of models of Peano arithmetic
- Automorphism group actions on trees
- Model companions of theories with an automorphism
- scientific article; zbMATH DE number 2144534 (Why is no real title available?)
- The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
- scientific article; zbMATH DE number 1406466 (Why is no real title available?)
- Decoding in the automorphism group of a recursively saturated model of arithmetic
- Automorphism groups of arithmetically saturated models
- Closed normal subgroups of the automorphism group of a saturated model of Peano arithmetic
- Self-embeddings of models of arithmetic; fixed points, small submodels, and extendability
- Rank-initial embeddings of non-standard models of set theory
- Automorphisms of models of arithmetic: a unified view
This page was built for publication: Automorphisms of recursively saturated models of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182432)
