The undecidability of self-embedding for term rewriting systems

DOI10.1016/0020-0190(85)90063-8zbMath0571.68025OpenAlexW2001610338MaRDI QIDQ1061484

David Alan Plaisted

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

zbMATH Keywords

terminationlooping property

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (8)

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

• Orderings for term-rewriting systems
• Unnamed Item

This page was built for publication: The undecidability of self-embedding for term rewriting systems