Die another day

DOI10.1007/s00224-008-9109-yzbMath1175.91038OpenAlexW2116914937MaRDI QIDQ2272192

Rudolf Fleischer

Publication date: 6 August 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9109-y

zbMATH Keywords

Peano arithmetictransfinite inductionPAKönig's lemmaBuchholz HydraHydra battle

Mathematics Subject Classification ID

Games involving graphs (91A43) First-order arithmetic and fragments (03F30)

Related Items (1)

Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations

Cites Work

• Unnamed Item
• Unnamed Item
• Weak König's lemma implies Brouwer's fan theorem: a direct proof
• An independence result for \((\Pi^ 1_ 1-CA)+BI\)
• A direct independence proof of Buchholz's Hydra Game on finite labeled trees
• A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem.
• Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
• Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation
• The Hydra Battle Revisited
• The 3x + 1 Problem and Its Generalizations
• TREES AND BALL GAMES
• Accessible Independence Results for Peano Arithmetic
• Some independence results for Peano arithmetic
• A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game
• A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
• Accessible Recursive Functions
• Classifying Phase Transition Thresholds for Goodstein Sequences and Hydra Games
• Nonstandard Arithmetic and Reverse Mathematics
• On the restricted ordinal theorem
• Does Mathematics Need New Axioms?
• The consistency of arithmetics

This page was built for publication: Die another day