Automorphisms of saturated and boundedly saturated models of arithmetic
The paper is devoted to the study of automorphism groups of saturated and boundedly saturated models of Peano arithmetic. A model is boundedly saturated if it is saturated with respect to bounded types. A type over a model \(M\) is bounded if it contains the formula \(x<a\) for some \(a\in M\). The authors prove several results analogous to previously known theorems concerning automorphisms and automorphism groups of countable recursively saturated models of PA. Some results are straightforward corollaries of corresponding statements about countable recursively saturated models, some require new alternative approaches. The authors prove an analog of a theorem of \textit{C. Smoryński} [``Back-and-forth inside a recursively saturated model of arithmetic, Stud. Logic Found. Math. 108, 273--278 (1982; Zbl 0503.03033)] and a theorem of \textit{R. Kaye} [``A Galois correspondence for countable recursively saturated models of Peano arithmetic, in: Automorphisms of first-order structures. Oxford: Clarendon Press. 293--312 (1994; Zbl 0824.03015)]. Let \(M\) be a boundedly saturated model of PA of cardinality \(\lambda\), and let \(G\) be its automorphism group. The first theorem states that a cut \(I\) of \(M\) is the largest cut fixed pointwise by some \(f\) in \(G\) iff \(I\) is closed under exponentiation and every downward cofinal subset of \(M\setminus I\) has cardinality smaller than \(\lambda\). The second theorem says that a closed subgroup of \(G\) is normal iff it is the pointwise stabilizer of an invariant cut of \(M\). The basis of the topology on \(G\) consists of all pointwise stabilizers of finite sets and their cosets. Among other results, it is shown that if \(M_1\) and \(M_2\) are saturated, \(M_1\) is an elementary extension of the standard model and \(M_2\) is not, then \(\text{Aut}(M_1)\not\cong\text{Aut}(M_2)\), and that every saturated model has short elementary cuts whose automorphism groups are nonisomorphic.
- Automorphisms of countable recursively saturated models of PA: A survey
- The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
- scientific article; zbMATH DE number 2144534
- Arithmetically saturated models of arithmetic
- Closed normal subgroups of the automorphism group of a saturated model of Peano arithmetic
- Automorphisms of recursively saturated models of arithmetic
- On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
- More automorphism groups of countable, arithmetically saturated models of Peano arithmetic
- Generic automorphisms and graph coloring
- Automorphisms of countable recursively saturated models of PA: A survey
- Automorphism groups of saturated models of Peano arithmetic
- Automorphisms of models of bounded arithmetic
- More on extending automorphisms of models of Peano Arithmetic
- Interstitial and pseudo gaps in models of Peano arithmetic
- On elementary cuts in recursively saturated models of Peano Arithmetic
- scientific article; zbMATH DE number 22356 (Why is no real title available?)
- Elementary cuts in saturated models of Peano arithmetic
- scientific article; zbMATH DE number 663795 (Why is no real title available?)
- Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets
- Automorphism groups of models of Peano arithmetic
- scientific article; zbMATH DE number 2144534 (Why is no real title available?)
- The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
- Automorphism groups of arithmetically saturated models
- Closed normal subgroups of the automorphism group of a saturated model of Peano arithmetic
- Automorphisms of models of arithmetic: a unified view
This page was built for publication: Automorphisms of saturated and boundedly saturated models of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645748)
