Arithmetically Saturated Models of Arithmetic

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

Abstract

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

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,170

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
2010-08-24

Downloads
45 (#549,249)

6 months
14 (#232,717)

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.
Automorphism groups of models of Peano arithmetic.James H. Schmerl - 2002 - Journal of Symbolic Logic 67 (4):1249-1264.
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