Automorphisms of recursively saturated models of arithmetic

Annals of Pure and Applied Logic 55 (1):67-99 (1991)
  Copy   BIBTEX

Abstract

We give an examination of the automorphism group Aut of a countable recursively saturated model M of PA. The main result is a characterisation of strong elementary initial segments of M as the initial segments consisting of fixed points of automorphisms of M. As a corollary we prove that, for any consistent completion T of PA, there are recursively saturated countable models M1, M2 of T, such that Aut[ncong]Aut, as topological groups with a natural topology. Other results include a classification of the normal subgroups of Aut of the form [lcub]g: g [uharr] A = idA[rcub], for sets A M, and a highly homogeneous representation of Aut as a subgroup of Aut

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,895

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2014-01-16

Downloads
43 (#625,652)

6 months
8 (#735,918)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Roman Kossak
City University of New York

Citations of this work

Fixed points of self-embeddings of models of arithmetic.Saeideh Bahrami & Ali Enayat - 2018 - Annals of Pure and Applied Logic 169 (6):487-513.
Rank-initial embeddings of non-standard models of set theory.Paul Kindvall Gorbow - 2020 - Archive for Mathematical Logic 59 (5-6):517-563.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
Iterated ultrapowers for the masses.Ali Enayat, Matt Kaufmann & Zachiri McKenzie - 2018 - Archive for Mathematical Logic 57 (5-6):557-576.

View all 29 citations / Add more citations

References found in this work

Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
Toward model theory through recursive saturation.John Stewart Schlipf - 1978 - Journal of Symbolic Logic 43 (2):183-206.
Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.

View all 14 references / Add more references