The undecidability of self-embedding for term rewriting systems
From MaRDI portal
Publication:1061484
DOI10.1016/0020-0190(85)90063-8zbMath0571.68025OpenAlexW2001610338MaRDI QIDQ1061484
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(85)90063-8
Related Items
Simple termination is difficult, The undecidability of self-embedding for finite semi-Thue and Thue systems, An equational logic sampler, Termination of rewriting, A field guide to equational logic, Simple termination is difficult, Relative undecidability in term rewriting. I: The termination hierarchy, Relative undecidability in term rewriting. II: The confluence hierarchy
Cites Work
