Die another day
From MaRDI portal
Publication:2272192
DOI10.1007/S00224-008-9109-YzbMATH Open1175.91038OpenAlexW2116914937MaRDI QIDQ2272192FDOQ2272192
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- The consistency of arithmetics
- Weak König's lemma implies Brouwer's fan theorem: a direct proof
- Some independence results for Peano arithmetic
- Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation
- Nonstandard Arithmetic and Reverse Mathematics
- The 3x + 1 Problem and Its Generalizations
- On the restricted ordinal theorem
- Accessible Independence Results for Peano Arithmetic
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
- Classifying phase transition thresholds for Goodstein sequences and hydra games
- An independence result for \((\Pi^ 1_ 1-CA)+BI\)
- The Hydra Battle Revisited
- A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game
- In memoriam: Kenneth Jon Barwise, 1942--2000
- Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
- TREES AND BALL GAMES
- 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.
- Title not available (Why is that?)
- Accessible Recursive Functions
Cited In (2)
This page was built for publication: Die another day
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272192)
