The Hydra battle and Cichon's principle

DOI10.1007/S00200-009-0094-4zbMath1181.68163OpenAlexW2086159557MaRDI QIDQ734036

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)

Related Items (4)

Unnamed Item ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations ⋮ On Transfinite Knuth-Bendix Orders ⋮ ON THE TERMINATION OF RUSSELL’S DESCRIPTION ELIMINATION ALGORITHM

Cites Work

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

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