The Hydra battle and Cichon's principle

DOI10.1007/S00200-009-0094-4MaRDI QIDQ734036zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

term rewrite system

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(7)

• scientific article; zbMATH DE number 4089568 (Why is no real title available?)
• scientific article; zbMATH DE number 7379291 (Why is no real title available?)
• 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)