Skip to main content
Log in

Epsilon substitution method for elementary analysis

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We formulate epsilon substitution method for elementary analysisEA (second order arithmetic with comprehension for arithmetical formulas with predicate parameters). Two proofs of its termination are presented. One uses embedding into ramified system of level one and cutelimination for this system. The second proof uses non-effective continuity argument.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ackermann, W.: Begründung des Tertium non datur mittels der Hilbertschen Theorie der Widerspruchsfreiheit. Math. Ann.93, 1–36 (1925)

    Google Scholar 

  2. Ackermann, W.: Zur Widerspruchsfreiheit der Zahlentheorie. Math. Ann.117, 162–164 (1940)

    Google Scholar 

  3. Bourbaki, N.: Theorie des ensembles. Paris: Hermann 1958

    Google Scholar 

  4. Gentzen, G.: Die Widerspruchsfreiheit der reinen Zahlentheorie. Math. Ann. 112, 493–565 (1936)

    Google Scholar 

  5. Girard, J.-Y.: Une extension de l'interpretation de Gödel a l'analyse et la application a l'elimination des coupures dans l'analyse et la theorie des types. Proc. 2nd Scand. Logic Symp., pp. 63–92, Amsterdam: North-Holland 1972

    Google Scholar 

  6. Hilbert, D.: Probleme der Grundlegung der Mathematik. Math. Ann.102, 1–9 (1929)

    Google Scholar 

  7. Hilbert, D., Bernays, P.: Grundlagen der Mathematik, Bd.2. Berlin Heidelberg New York: Springer 1970

    Google Scholar 

  8. Kreisel, G.: On the interpretation of non-finitist proofs I. J. Symb. Logic16, 241–267 (1951)

    Google Scholar 

  9. Kreisel, G.: On the Interpretation of Non-finitist proofs II. J. Symb. Logic17, 43–58 (1952)

    Google Scholar 

  10. Mints, G.: Simplified consistency proof for arithmetic (Russian). Proc. Estonian Acad. Sci. Fiz.-Math.31, 376–382 (1982)

    Google Scholar 

  11. Mints, G.: Epsilon substitution method for the theory of hereditarily finite sets (Russian). Proc. Eston. Acad. Sci. Fiz.-Math.N2, 154–164 (1989)

    Google Scholar 

  12. Mints, G.: Gentzen-type systems and Hilbert's epsilon substitution method, Vol. I. In: Logic, Method and Philosophy of Science, Vol. IX, pp. 91–122. Amsterdam: Elsevier (1994)

    Google Scholar 

  13. Mints, G., Tupailo, S.: Epsilon substitution method for elementary analysis. Report No. CSLI-93-175, 1993, CSLI, Stanford University (1993)

  14. Kleene, S.C.: Introduction to Metamathematics. New York Toronto: Van Nostrand 1952

    Google Scholar 

  15. von Neumann, J.: Zur Hilbertschen Beweistheorie. Math. Z.26, 1–46 (1927)

    Google Scholar 

  16. Schutte, K.: Proof Theory. Berlin Heidelberg New York: Springer 1977

    Google Scholar 

  17. Tait, W.: Functionals defined by transfinite recursion. J. Symb. Logic30, 155–174 (1965)

    Google Scholar 

  18. Tait, W.: The substitution method. J. Symb. Logic30, 175–192 (1965)

    Google Scholar 

  19. Weyl, H.: David Hilbert and his mathematical work. Bull. Amer. Math. Soc.50, 612–654 (1944)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Grigori Mints.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mints, G., Tupailo, S. & Buchholz, W. Epsilon substitution method for elementary analysis. Arch Math Logic 35, 103–130 (1996). https://doi.org/10.1007/BF01273688

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01273688

Mathematics Subject Classification

Navigation