Elementary Recursive Nonstandard Analysis, in short ERNA, is a constructive system of nonstandard analysis proposed around 1995 by Patrick Suppes and Richard Sommer, who also proved its consistency inside PRA. It is based on an earlier system developed by Rolando Chuaqui and Patrick Suppes, of which Michal Rössler and Emil Jeřábek have recently proposed a weakened version. We add a Π1-transfer principle to ERNA and prove the consistency of the extended theory inside PRA. In this extension of ERNA a Σ1-supremum principle ‘up-to-infinitesimals’, and some well-known calculus results for sequences are deduced. Finally, we prove that transfer is ‘too strong’ for finitism by reconsidering Rössler and Jeřábek’s conclusions.
"Transfer and a supremum principle for ERNA." J. Symbolic Logic 73 (2) 689 - 710, June 2008. https://doi.org/10.2178/jsl/1208359067