Computer Science Logic

DOI10.1007/b100120zbMath1095.68046OpenAlexW2481899496MaRDI QIDQ5311249

Rajeev Goré, Jeremy E. Dawson

Publication date: 22 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100120

zbMATH Keywords

rewritingterminationrecursive path orderingwell-founded ordering

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

An effective proof of the well-foundedness of the multiset path ordering, Some general results about proof normalization, Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations