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

DOI10.1093/JIGPAL/5.6.787zbMATH Open0894.03018OpenAlexW1995834205MaRDI QIDQ4372852FDOQ4372852

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

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

zbMATH Keywords

automorphismfixed point setnonstandard modelrecursively saturated modelPeano Arithmeticstandard systemelementary cutSkolem closureminimal typesfixed submodels

Mathematics Subject Classification ID

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

Cited In (12)

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

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)