论文信息 - Update Procedures and the 1-Consistency of Arithmetic

Update Procedures and the 1-Consistency of Arithmetic

The 1-consistency of arithmetic is shown to be equivalent to the existence of fixed points of a certain type of update procedure, which is implicit in the epsilon-substitution method.

Jeremy Avigad

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

[2] G. Mints,et al. Gentzen-type systems and Hilbert's epsilon substitution method. I , 1995 .

[3] Grigori Mints,et al. Epsilon – Substitution Method for the Ramified Language and ∆ 11-Comprehension Rule , 1998 .

[4] H. E. Rose. Subrecursion: Functions and Hierarchies , 1984 .

[5] Toshiyasu Arai. Epsilon substitution method for theories of jump hierarchies , 2002, Arch. Math. Log..

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

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

[8] Samuel R. Buss,et al. The witness function method and provably recursive functions of peano arithmetic , 1995 .

[9] Grigori Mints,et al. Strong termination for the epsilon substitution method , 1996, Journal of Symbolic Logic.

[10] Harvey M. Friedman,et al. Finite functions and the necessary use of large cardinals , 1998, math/9811187.

[11] Jeremy Avigad,et al. An Ordinal Analysis of Admissible Set Theory using Recursion on Ordinal Notations , 2002, J. Math. Log..

[12] Petr Hájek,et al. Metamathematics of First-Order Arithmetic , 1993, Perspectives in mathematical logic.

[13] Harvey M. Friedman,et al. Elementary Descent Recursion and Proof Theory , 1995, Ann. Pure Appl. Log..