Abstract
For two hierarchies of properties of term rewriting systems related to confluence and termination, respectively, we prove relative undecidability: for implications X ⇒ Y in the hierarchies the property X is undecidable for term rewriting systems satisfying Y.
Cite
CITATION STYLE
APA
Geser, A., Middeldorp, A., Ohlebusch, E., & Zantema, H. (1997). Relative undecidability in term rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1258, pp. 150–166). Springer Verlag. https://doi.org/10.1007/3-540-63172-0_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free