Automorphisms of Countable Short Recursively Saturated Models of PA

Notre Dame Journal of Formal Logic 49 (4):345-360 (2008)
  Copy   BIBTEX

Abstract

A model of Peano Arithmetic is short recursively saturated if it realizes all its bounded finitely realized recursive types. Short recursively saturated models of $\PA$ are exactly the elementary initial segments of recursively saturated models of $\PA$. In this paper, we survey and prove results on short recursively saturated models of $\PA$ and their automorphisms. In particular, we investigate a certain subgroup of the automorphism group of such models. This subgroup, denoted $G|_{M(a)}$, contains all the automorphisms of a countable short recursively saturated model of which can be extended to an automorphism of the countable recursively saturated elementary end extension of the model

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

External links

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

Through your library

Similar books and articles

Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Generic Expansions of Countable Models.Silvia Barbina & Domenico Zambella - 2012 - Notre Dame Journal of Formal Logic 53 (4):511-523.
Transplendent Models: Expansions Omitting a Type.Fredrik Engström & Richard W. Kaye - 2012 - Notre Dame Journal of Formal Logic 53 (3):413-428.
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.

Analytics

Added to PP
2010-09-13

Downloads
35 (#459,020)

6 months
14 (#184,493)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
Discernible elements in models for peano arithmetic.Andrzej Ehrenfeucht - 1973 - Journal of Symbolic Logic 38 (2):291-292.
Automorphism Groups of Arithmetically Saturated Models.Ermek S. Nurkhaidarov - 2006 - Journal of Symbolic Logic 71 (1):203 - 216.

View all 14 references / Add more references