Total termination of term rewriting is undecidable

DOI10.1006/jsco.1995.1037zbMath0843.68047OpenAlexW2154964291MaRDI QIDQ1911402

Hans Zantema

Publication date: 13 August 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/17344

zbMATH Keywords

term rewriting systemsPost's correspondence problem

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Problems in rewriting III, Polynomials over the reals in proofs of termination : from theory to practice, Simple termination of rewrite systems, Levels of undecidability in rewriting, Termination Tools in Ordered Completion, Relative undecidability in term rewriting. I: The termination hierarchy, Relative undecidability in term rewriting. II: The confluence hierarchy