论文信息 - Worms, gaps, and hydras

Worms, gaps, and hydras

We define a direct translation from finite rooted trees to finite natural functions which shows that the Worm Principle introduced by Lev Beklemishev is equivalent to a very slight variant of the well-known Kirby-Paris' Hydra Game. We further show that the elements in a reduction sequence of the Worm Principle determine a bad sequence in the well-quasi-ordering of finite sequences of natural numbers with respect to Friedman's gapembeddability. A characterization of gap-embeddability in terms of provability logic due to Lev Beklemishev is also presented. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

Lorenzo Carlucci

[1] Andreas Weiermann,et al. A CLASSIFICATION OF RAPIDLY GROWING RAMSEY FUNCTIONS , 1976 .

[2] Lew Gordeev,et al. Generalizations of the one-dimensional version of the Kruskal-Friedman theorems , 1989, Journal of Symbolic Logic.

[3] Stephen G. Simpson,et al. Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen , 1985, Arch. Math. Log..

[4] Lorenzo Carlucci,et al. A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem , 2003, Theor. Comput. Sci..

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

[6] Konstantin N. Ignatiev,et al. On strong provability predicates and the associated modal logics , 1993, Journal of Symbolic Logic.

[7] Lev D. Beklemishev. The Worm principle , 2003 .

[8] Lev D. Beklemishev,et al. Provability algebras and proof-theoretic ordinals, I , 2001, Ann. Pure Appl. Log..

[9] Lew Gordeev,et al. A modified sentence unprovable in PA , 1994, Journal of Symbolic Logic.

[10] D.H.J. de Jongh,et al. The logic of the provability , 1998 .