Premium
A Relationship Among Gentzen's Proof‐Reduction, Kirby‐Paris' Hydra Game and Buchholz's Hydra Game
Author(s) -
Hamano Masahiro,
Okada Mitsuhiro
Publication year - 1997
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19970430113
Subject(s) - mathematics , lernaean hydra , mathematical economics , reduction (mathematics) , game theory , history , classics , geometry
We first note that Gentzen's proof‐reduction for his consistency proof of PA can be directly interpreted as moves of Kirby‐Paris' Hydra Game, which implies a direct independence proof of the game (Section 1 and Appendix). Buchholz's Hydra Game for labeled hydras is known to be much stronger than PA. However, we show that the one‐dimensional version of Buchholz's Game can be exactly identified to Kirby‐Paris' Game (which is two‐dimensional but without labels), by a simple and natural interpretation (Section 2). Jervell proposed another type of a combinatorial game, by abstracting Gentzen's proof‐reductions and showed that his game is independent of PA. We show (Section 3) that this Jervell's game is actually much stronger than PA, by showing that the critical ordinal of Jervell's game is φ ω (0) (while that of PA or of Kirby‐Paris' Game is φ 1 (0) = ϵ 0 ) in the Veblen hierarchy of ordinals.