Termination proofs by multiset path orderings imply primitive recursive derivation lengths

DOI10.1007/3-540-53162-9_50zbMath1494.68111OpenAlexW4230078282MaRDI QIDQ5096206

Dieter Hofbauer

Publication date: 16 August 2022

Published in: Algebraic and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53162-9_50

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Hierarchies of computability and definability (03D55)

Related Items (7)

Termination of term rewriting by interpretation ⋮ Time bounded rewrite systems and termination proofs by generalized embedding ⋮ Proof-theoretic analysis of termination proofs ⋮ Analyzing Innermost Runtime Complexity Through Tuple Interpretations ⋮ Unnamed Item ⋮ Term rewriting theory for the primitive recursive functions ⋮ Some results on cut-elimination, provable well-orderings, induction and reflection

Cites Work

• Orderings for term-rewriting systems
• Termination of rewriting
• Path of subterms ordering and recursive decomposition ordering revisited
• Computability, complexity, logic. Transl. from the German
• Extensions and comparison of simplification orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Termination proofs by multiset path orderings imply primitive recursive derivation lengths