Relative undecidability in the termination hierarchy of single rewrite rules [chapter]

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
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