Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets

DOI10.1093/JIGPAL/5.6.787MaRDI QIDQ4372852zbMATH OpenOpenAlexFDO

Authors Roman Kossak

Publication date 17 December 1997

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/5.6.787

zbMATH Keywords

automorphismelementary cutfixed point setfixed submodelsminimal typesnonstandard modelPeano Arithmeticrecursively saturated modelSkolem closurestandard system

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)

Review text

The most important notions used in this paper, like fixed point set \(\text{fix}(\alpha)\) of an automorphism \(\alpha\) of a countable recursively saturated model \(M\) of Peano Arithmetic (PA), elementary cut of \(M\), standard system of \(M\), are defined in the introduction. In the second part, the author gives a survey of known results on fixed submodels and their characterization. Moreover, the following two facts are proved: Every fixed submodel of a countable recursively saturated model \(M\) of PA, which is not arithmetically saturated, is isomorphic to \(M\). Each countable model of PA is isomorphic to a fixed subset of a countable arithmetically saturated model of PA. The third section deals with minimal types. It was shown that every rcursively saturated model of PA realizes infinitely many pairwise independent minimal types. Using the notions of Skolem closure of a subset of \(M\) and the gap of an element of \(M\), the author presents certain properties of minimal types. The main result is proved in the fourth section: Let \(\{c_i: i\in\omega\}\) be a cofinal subset of a countable arithmetically saturated model \(M\) of PA such that for every \(i\), \(\text{gap}(c_i)< \text{gap}(c_{i+ 1})\), and every \(c_i\) realizes a minimal type. Then there is an automorphism \(\alpha\) of \(M\) such that \(\text{fix}(\alpha)= H(\{c_i: i\in\Omega\})\). A consequence of this theorem is the fact that each countable arithmetically saturated model of PA has continuum many nonisomorphic fixed submodels.

Recommendations

• Arithmetically saturated models of arithmetic
• scientific article; zbMATH DE number 2144534
• Automorphisms of countable recursively saturated models of PA: A survey
• Automorphisms of saturated and boundedly saturated models of arithmetic

Cited in

(13)

• Automorphisms of recursively saturated models of arithmetic
• On closed elementary cuts in recursively saturated models of Peano arithmetic
• Fixed points of self-embeddings of models of arithmetic
• Order-types of models of arithmetic and a connection with arithmetic saturation
• Automorphisms of countable recursively saturated models of PA: A survey
• Arithmetically saturated models of arithmetic
• ON AUTOMORPHISMS OF RESPLENDENT MODELS OF ARITHMETIC
• scientific article; zbMATH DE number 4010521 (Why is no real title available?)
• A Note on Real Subsets of A Recursively Saturated Model
• Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts
• scientific article; zbMATH DE number 2144534 (Why is no real title available?)
• The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
• Automorphisms of models of arithmetic: a unified view

This page was built for publication: Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets

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