Arithmetically Saturated Models of Arithmetic

Notre Dame Journal of Formal Logic 36 (4):531-546 (1995)
  Copy   BIBTEX


The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. We consider questions concerning the automorphism group of a countable recursively saturated model of PA. We prove new results concerning fixed point sets, open subgroups, and the cofinality of the automorphism group. We also prove that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of its elementary substructures



    Upload a copy of this work     Papers currently archived: 93,296

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

Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Automorphism Groups of Arithmetically Saturated Models.Ermek S. Nurkhaidarov - 2006 - Journal of Symbolic Logic 71 (1):203 - 216.


Added to PP

11 (#1,167,245)

6 months
23 (#125,194)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Roman Kossak
City University of New York

Citations of this work

Automorphisms of models of arithmetic: a unified view.Ali Enayat - 2007 - Annals of Pure and Applied Logic 145 (1):16-36.
Moving Intersticial Gaps.James H. Schmerl - 2002 - Mathematical Logic Quarterly 48 (2):283-296.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.

View all 10 citations / Add more citations