Saturated models of peano arithmetic

Journal of Symbolic Logic 47 (3):625-637 (1982)
  Copy   BIBTEX

Abstract

We study reducts of Peano arithmetic for which conditions of saturation imply the corresponding conditions for the whole model. It is shown that very weak reducts (like pure order) have such a property for κ-saturation in every κ ≥ ω 1 . In contrast, other reducts do the job for ω and not for $\kappa > \omega_1$ . This solves negatively a conjecture of Chang

Categories

Keywords

Reprint years

DOI

10.2307/2273592

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: 105,219

External links

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

Through your library

My notes

Similar books and articles

Some highly saturated models of Peano arithmetic.James H. Schmerl - 2002 - Journal of Symbolic Logic 67 (4):1265-1273.
Automorphism Groups of Saturated Models of Peano Arithmetic.Ermek S. Nurkhaidarov & James H. Schmerl - 2014 - Journal of Symbolic Logic 79 (2):561-584.
Automorphism Groups of Countable Arithmetically Saturated Models of Peano Arithmetic.James H. Schmerl - 2015 - Journal of Symbolic Logic 80 (4):1411-1434.
On interstices of countable arithmetically saturated models of Peano arithmetic.Nicholas Bamber & Henryk Kotlarski - 1997 - Mathematical Logic Quarterly 43 (4):525-540.
On closed elementary cuts in recursively saturated models of Peano arithmetic.Bożena Piekart - 1993 - Notre Dame Journal of Formal Logic 34 (2):223-230.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets.Roman Kossak - 1997 - Logic Journal of the IGPL 5 (6):787-794.
Automorphism Groups of Arithmetically Saturated Models.Ermek S. Nurkhaidarov - 2006 - Journal of Symbolic Logic 71 (1):203 - 216.
Decoding in the automorphism group of a recursively saturated model of arithmetic.Ermek Nurkhaidarov - 2015 - Mathematical Logic Quarterly 61 (3):179-188.

Analytics

Added to PP
2009-01-28

Downloads
59 (#397,275)

6 months
8 (#526,967)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Atomic saturation of reduced powers.Saharon Shelah - 2021 - Mathematical Logic Quarterly 67 (1):18-42.
Worlds of Homogeneous Artifacts.Athanassios Tzouvaras - 1995 - Notre Dame Journal of Formal Logic 36 (3):454-474.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.

View all 6 citations / Add more citations

References found in this work

Review: C. C. Chang, H. J. Keisler, Model Theory. [REVIEW]Michael Makkai - 1991 - Journal of Symbolic Logic 56 (3):1096-1097.
Review: Joseph R. Shoenfield, Mathematical Logic. [REVIEW]J. Donald Monk - 2001 - Bulletin of Symbolic Logic 7 (3):376-376.

Add more references