Real closures of models of weak arithmetic
In [\textit{P. D'Aquino} et al., J. Symb. Log. 75, No. 1, 1--11 (2010; Zbl 1186.03061)] it was shown that every non-Archimedean real closed field with an integer part satisfying the Peano axioms must be recursively saturated. It was noted that it follows from the proof that instead of PA one can assume \(\mathrm{I}\Sigma_4\), and a simple example is given to show that \(\mathrm{I}\Delta_0\) is not enough. In the present paper, the authors improve the upper bound by proving the result using \(\mathrm{I}E_2\) -- the induction schema for formulas with two alternating blocks of bounded quantifiers, starting with existential ones. They also give variants of the result with \(\mathrm{I}E_2\) replaced by two weak subtheories of Buss's bounded arithmetic. Concerning the lower bound, a construction of \textit{S. T. Smith} [J. Algebra 159, No. 1, 191--239 (1993; Zbl 0799.13010)], based on earlier work by Macintyre, Marker, and Wilkie, is used to build a nonstandard model of Open Induction satisfying the Bézout axiom whose real closure is not recursively saturated. There is also an interesting connection to Tennenbaum's theorem: It is shown that if an ordered ring \(A\) is a model of Open Induction and the real closure of \(A\) is recursively saturated, then \(+_A\) and \(\leq_A\) cannot be both recursive.
- A recursive nonstandard model for open induction with GCD property and cofinal primes
- A recursive nonstandard model of normal open induction
- Algorithms in real algebraic geometry
- An introduction to recursively saturated and resplendent models
- Bootstrapping. I
- Bounded existential induction
- Building discretely ordered Bezout domains and GCD domains
- Corrigendum to: ``Real closed fields and models of arithmetic
- Every real closed field has an integer part
- scientific article; zbMATH DE number 3836033 (Why is no real title available?)
- scientific article; zbMATH DE number 440481 (Why is no real title available?)
- scientific article; zbMATH DE number 3702663 (Why is no real title available?)
- scientific article; zbMATH DE number 1144041 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 3214534 (Why is no real title available?)
- Logical foundations of proof complexity
- Model Theory
- Modern computer algebra
- On the complexity of models of arithmetic
- Primes and their residue rings in models of open induction
- Real closed fields and models of Peano arithmetic
- The strength of sharply bounded induction requires MSP
- UNCOUNTABLE REAL CLOSED FIELDS WITH PA INTEGER PARTS
- On the value group of a model of Peano arithmetic
- scientific article; zbMATH DE number 4150341 (Why is no real title available?)
- Existentially Closed Models and Conservation Results in Bounded Arithmetic
- A recursive model for arithmetic with weak induction
- Bounded existential induction
- Open induction and the true theory of rationals
- Real closed fields and models of Peano arithmetic
- A recursive nonstandard model for open induction with GCD property and cofinal primes
- Existence of saturated structures
- UNCOUNTABLE REAL CLOSED FIELDS WITH PA INTEGER PARTS
- scientific article; zbMATH DE number 4185776 (Why is no real title available?)
- Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts
This page was built for publication: Real closures of models of weak arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935370)
