Strong termination for the epsilon substitution method

Journal of Symbolic Logic 61 (4):1193-1205 (1996)
  Copy   BIBTEX

Abstract

Ackermann proved termination for a special order of reductions in Hilbert's epsilon substitution method for the first order arithmetic. We establish termination for arbitrary order of reductions

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
248 (#78,850)

6 months
34 (#99,370)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Epsilon substitution method for ID1.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 121 (2-3):163-208.
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.

Add more citations

References found in this work

Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.
Theorie des Ensembles.N. Bourbaki - 1959 - Journal of Symbolic Logic 24 (1):71-73.

Add more references