论文信息 - Strong termination for the epsilon substitution method

Strong termination for the epsilon substitution method

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. ?

Grigori Mints | G. Mints

[1] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .

[2] P. Bernays,et al. Grundlagen der Mathematik , 1934 .

[3] J. Neumann. Zur Hilbertschen Beweistheorie , 1927 .

[4] Wilhelm Ackermann,et al. Zur Widerspruchsfreiheit der Zahlentheorie , 1940 .

[5] D. Hilbert,et al. Probleme der Grundlegung der Mathematik , 1930 .

[6] G. Gentzen. Die Widerspruchsfreiheit der reinen Zahlentheorie , 1936 .

[7] Nicolas Bourbaki,et al. Théorie des ensembles , 1954 .

[8] Grigori Mints,et al. Epsilon substitution method for elementary analysis , 1996, Arch. Math. Log..

[9] William W. Tait,et al. The substitution method , 1965, Journal of Symbolic Logic.

[10] William W. Tait. Functionals Defined by Transfinite Recursion , 1965, J. Symb. Log..

[11] Hermann Weyl,et al. David Hilbert and his mathematical work , 1944 .

[12] Georg Kreisel,et al. On the interpretation of non-finitist proofs—Part I , 1951, Journal of Symbolic Logic.

[13] Wilhelm Ackermann,et al. Begründung des „tertium non datur” mittels der Hilbertschen Theorie der Widerspruchsfreiheit , 1925 .