论文信息 - A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem

A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem

A new proof is given for the independence of the termination of Kirby-Paris' Hydra Game from Peano Arithmetic by showing that it is strong enough to entail the termination of Gentzen's Reduction Strategy for proof figures via an appropriate translation from derivations to hydras.

Lorenzo Carlucci | L. Carlucci

[1] Mitsuhiro Okada,et al. A direct independence proof of Buchholz's Hydra Game on finite labeled trees , 1998, Arch. Math. Log..

[2] J. Paris,et al. Accessible Independence Results for Peano Arithmetic , 1982 .

[3] Wilfried Buchholz,et al. An independence result for (II11-CA)+BI , 1987, Ann. Pure Appl. Log..

[4] Jussi KETONENt,et al. Rapidly growing Ramsey functions , 1981 .

[5] E. Cichon. A short proof of two recently discovered independence results using recursion theoretic methods , 1983 .

[6] Mitsuhiro Okada,et al. A Relationship Among Gentzen's Proof‐Reduction, Kirby‐Paris' Hydra Game and Buchholz's Hydra Game , 1995, Math. Log. Q..

[7] S. Wainer,et al. Provably computable functions and the fast growing hierarchy , 1987 .

[8] Stephen G. Simpson,et al. Logic and Combinatorics , 1987 .