Real closed fields and models of Peano arithmetic

Journal of Symbolic Logic 75 (1):1-11 (2010)
  Copy   BIBTEX


Shepherdson [14] showed that for a discrete ordered ring I, I is a model of IOpen iff I is an integer part of a real closed ordered field. In this paper, we consider integer parts satisfying PA. We show that if a real closed ordered field R has an integer part I that is a nonstandard model of PA (or even IΣ₄), then R must be recursively saturated. In particular, the real closure of I, RC (I), is recursively saturated. We also show that if R is a countable recursively saturated real closed ordered field, then there is an integer part I such that R = RC(I) and I is a nonstandard model of PA



    Upload a copy of this work     Papers currently archived: 91,271

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

Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Groundwork for weak analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.
Regularity in models of arithmetic.George Mills & Jeff Paris - 1984 - Journal of Symbolic Logic 49 (1):272-280.
Notes on the stability of separably closed fields.Carol Wood - 1979 - Journal of Symbolic Logic 44 (3):412-416.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Saturated models of peano arithmetic.J. F. Pabion - 1982 - Journal of Symbolic Logic 47 (3):625-637.


Added to PP

45 (#340,687)

6 months
7 (#382,198)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Real closures of models of weak arithmetic.Emil Jeřábek & Leszek Aleksander Kołodziejczyk - 2013 - Archive for Mathematical Logic 52 (1-2):143-157.
A construction of real closed fields.Yu-Ichi Tanaka & Akito Tsuboi - 2015 - Mathematical Logic Quarterly 61 (3):159-168.
Limit computable integer parts.Paola D’Aquino, Julia Knight & Karen Lange - 2011 - Archive for Mathematical Logic 50 (7-8):681-695.
Representing Scott sets in algebraic settings.Alf Dolich, Julia F. Knight, Karen Lange & David Marker - 2015 - Archive for Mathematical Logic 54 (5-6):631-637.
Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts.Emil Jeřábek - 2023 - Mathematical Logic Quarterly 69 (2):244-260.

View all 6 citations / Add more citations

References found in this work

Recursively saturated models generated by indiscernibles.James H. Schmerl - 1985 - Notre Dame Journal of Formal Logic 26 (2):99-105.

Add more references