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

DOI10.1093/JIGPAL/5.6.787zbMath0894.03018OpenAlexW1995834205MaRDI QIDQ4372852

Roman Kossak

Publication date: 17 December 1997

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

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

zbMATH Keywords

automorphismfixed point setPeano Arithmeticnonstandard modelrecursively saturated modelstandard systemelementary cutSkolem closureminimal typesfixed submodels

Mathematics Subject Classification ID

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

Related Items (1)

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