Simple termination revisited

DOI10.1007/3-540-58156-1_33zbMath1433.68191OpenAlexW1870663603MaRDI QIDQ5210790

Aart Middeldorp, Hans Zantema

Publication date: 21 January 2020

Published in: Automated Deduction — CADE-12 (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/17074

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Simple termination of rewrite systems

Cites Work

• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Termination of rewriting
• A note on simplification orderings
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Proving termination with multiset orderings
• Total termination of term rewriting
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Termination of term rewriting by interpretation

This page was built for publication: Simple termination revisited