The Hydra battle and Cichon's principle

DOI10.1007/S00200-009-0094-4zbMATH Open1181.68163OpenAlexW2086159557MaRDI QIDQ734036FDOQ734036

Authors: Georg Moser 

Publication date: 19 October 2009

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-009-0094-4

Recommendations

• The Hydra Battle Revisited
• scientific article; zbMATH DE number 5172485
• Hydra Games and Tree Ordinals
• A direct independence proof of Buchholz's Hydra Game on finite labeled trees
• Simply terminating rewrite systems with long derivations

zbMATH Keywords

term rewrite system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Recursive ordinals and ordinal notations (03F15)

Cites Work

• Termination of term rewriting: Interpretation and type elimination
• Handbook of proof theory
• Title not available (Why is that?)
• Termination of term rewriting using dependency pairs
• Proving termination with multiset orderings
• Proof theory. 2nd ed
• Term Rewriting and All That
• Proof theory. The first step into impredicativity
• Title not available (Why is that?)
• Proof-theoretic analysis of termination proofs
• Accessible Independence Results for Peano Arithmetic
• A Uniform Approach to Fundamental Sequences and Hierarchies
• Termination proofs by multiset path orderings imply primitive recursive derivation lengths
• Simply terminating rewrite systems with long derivations
• The Hydra Battle Revisited
• Title not available (Why is that?)
• Derivation lengths and order types of Knuth--Bendix orders
• Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Derivational Complexity of Knuth-Bendix Orders Revisited

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Hydra Battle Revisited
• On the termination of Russell's description elimination algorithm
• A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game
• Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations
• On transfinite Knuth-Bendix orders

This page was built for publication: The Hydra battle and Cichon's principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734036)