Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T05:37:21.992Z Has data issue: false hasContentIssue false

Saturation and Σ2-transfer for ERNA

Published online by Cambridge University Press:  12 March 2014

Chris Impens
Affiliation:
University of Ghent, Department of Pure Mathematics and Computer Algebra, Galglaan 2, B-9000 Gent, Belgium, E-mail: ci@cage.ugent.be
Sam Sanders
Affiliation:
University of Ghent, Department of Pure Mathematics and Computer Algebra, Galglaan 2, B-9000 Gent, Belgium, E-mail: sasander@cage.ugent.be

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. It is built on a previous system by Rolando Chuaqui and Patrick Suppes, which was recently reconsidered by Michal Rössler and Emil Jeřábek. A Π1-transfer principle has already been added to ERNA and the consistency of the resulting theory proved in PRA. Here, we equip ERNA with Σ2-transfer and a saturation principle, while keeping the consistency proof inside PRA. We show that the extended theory allows for generalized transfer, a basic tool of nonstandard analysis, and interprets several strong theories, like BΣ2 and IΣ2.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable