Automorphisms of models of arithmetic: a unified view
The unification referred to in the title concerns a general framework for iterated ultrapower constructions over models of arithmetic. Enayat develops a general method which combines features of the Skolem-Gaifman ultrapowers using definable functions, and Kirby-Paris ultrapowers utilizing coded functions defined on initial segments. Using his technique, Enayat gives proofs of some known results on automorohisms of countable recursively saturated models of PA and proves some new theorems. The new proofs are simpler and the statements sharper. For example, it is shown in [\textit{R. Kaye, R. Kossak} and \textit{H. Kotlarski}, ``Automorphisms of recursively saturated models of arithmetic, Ann. Pure Appl. Logic 55, 67--99 (1991; Zbl 0748.03023)] that every countable arithmetically saturated model of PA has an automorphism moving all undefinable elements. The proof is based on a rather delicate back-and-forth construction. Enayat's proof is simpler, and in addition gives the following: if \(M\) is a countable arithmetically saturated model of PA, then there is a group embedding \(j\mapsto\widehat j\) from the group of order-preserving permutations of the rational numbers into \(\Aut(M)\) such that for each \(j\) in \(\Aut(Q,<)\) which is fixed point-free, \(\widehat j\) moves every undefinable element of \(M\). The main new result is a confirmation of the following long-standing conjecture of Jim Schmerl: Let \(M\) be a countable arithmetically saturated model of PA, and let \(K\) be an elementary submodel of \(M\). Then \(M\) has an automorphism \(f\) such that the submodel of \(M\) consisting of the elements fixed by \(f\) is isomorphic to \(K\).
- Automorphisms of models of bounded arithmetic
- Automorphisms of recursively saturated models of arithmetic
- Automorphisms of saturated and boundedly saturated models of arithmetic
- ON AUTOMORPHISMS OF RESPLENDENT MODELS OF ARITHMETIC
- Automorphisms and constructions of models of set theory
- scientific article; zbMATH DE number 889876
- Automorphism groups of arithmetically saturated models
- On the number of automorphisms of uncountable models
- Automorphism groups of models of Peano arithmetic
- Automorphisms of models of true arithmetic: Recognizing some basic open subgroups
- A Combinatorial Theorem
- A simple tree lemma and its application to a counterexample of philips
- Arithmetically saturated models of arithmetic
- Automorphism groups of models of Peano arithmetic
- Automorphisms moving all non-algebraic points and an application to NF
- Automorphisms of countable recursively saturated models of PA: A survey
- Automorphisms of models of bounded arithmetic
- Automorphisms of recursively saturated models of arithmetic
- Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets
- Automorphisms with only infinite orbits on non-algebraic elements
- Closure properties of countable non-standard integers
- From bounded arithmetic to second order arithmetic via automorphisms
- scientific article; zbMATH DE number 3882428 (Why is no real title available?)
- scientific article; zbMATH DE number 4002096 (Why is no real title available?)
- scientific article; zbMATH DE number 3652325 (Why is no real title available?)
- scientific article; zbMATH DE number 3741468 (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 57851 (Why is no real title available?)
- scientific article; zbMATH DE number 3534482 (Why is no real title available?)
- scientific article; zbMATH DE number 3566838 (Why is no real title available?)
- scientific article; zbMATH DE number 1222926 (Why is no real title available?)
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 638942 (Why is no real title available?)
- scientific article; zbMATH DE number 3437141 (Why is no real title available?)
- scientific article; zbMATH DE number 3204609 (Why is no real title available?)
- Models and types of Peano's arithmetic
- Note on Canonical Partitions
- On elementary cuts in recursively saturated models of Peano Arithmetic
- On two questions concerning the automorphism groups of countable recursively saturated models of PA
- Partition Theorems and Computability Theory
- Recursively saturated models generated by indiscernibles
- Results on automorphisms of recursively saturated models of PA
- Some applications of iterated ultrapowers in set theory
- Some problem in elementary arithmetics
- The structure of models of Peano arithmetic
- Toward model theory through recursive saturation
- Ultrafilters and types on models of arithmetic
- Automorphisms of recursively saturated models of arithmetic
- Iterated ultrapowers for the masses
- Fixed points of self-embeddings of models of arithmetic
- Models of arithmetic in \(A\)-isols
- The complexity of classification problems for models of arithmetic
- A Galois correspondence for countable short recursively saturated models of PA
- scientific article; zbMATH DE number 57851 (Why is no real title available?)
- Model companions of theories with an automorphism
- Self-embeddings of models of arithmetic; fixed points, small submodels, and extendability
- Rank-initial embeddings of non-standard models of set theory
This page was built for publication: Automorphisms of models of arithmetic: a unified view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866555)
