A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Relative undecidability in the termination hierarchy of single rewrite rules
[chapter]
1997
Lecture Notes in Computer Science
For a hierarchy of properties of term rewriting systems, related to termination, we prove relative undecidability even in the case of single rewrite rules: for implications X ~ Y in the hierarchy the property X is uudecidable for rewrite rules satisfying Y.
doi:10.1007/bfb0030600
fatcat:4uluxiav4zdrfhhf536qld4dxq