June 2011 ERNA and Friedman's Reverse Mathematics
Sam Sanders
J. Symbolic Logic 76(2): 637-664 (June 2011). DOI: 10.2178/jsl/1305810768

Abstract

Elementary Recursive Nonstandard Analysis, in short ERNA, is a constructive system of nonstandard analysis with a PRA consistency proof, proposed around 1995 by Patrick Suppes and Richard Sommer. Recently, the author showed the consistency of ERNA with several transfer principles and proved results of nonstandard analysis in the resulting theories (see [12] and [13]). Here, we show that Weak König's lemma (WKL) and many of its equivalent formulations over RCA₀ from Reverse Mathematics (see [21] and [22]) can be ‘pushed down' into the weak theory ERNA, while preserving the equivalences, but at the price of replacing equality with equality ‘up to infinitesimals'. It turns out that ERNA plays the role of RCA₀ and that transfer for universal formulas corresponds to WKL.

Citation

Download Citation

Sam Sanders. "ERNA and Friedman's Reverse Mathematics." J. Symbolic Logic 76 (2) 637 - 664, June 2011. https://doi.org/10.2178/jsl/1305810768

Information

Published: June 2011
First available in Project Euclid: 19 May 2011

zbMATH: 1231.03059
MathSciNet: MR2830420
Digital Object Identifier: 10.2178/jsl/1305810768

Rights: Copyright © 2011 Association for Symbolic Logic

JOURNAL ARTICLE
28 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.76 • No. 2 • June 2011
Back to Top