Omega-termination is undecidable for totally terminating term rewriting systems

DOI10.1006/jsco.1996.0095zbMath0872.68082OpenAlexW1999336682MaRDI QIDQ1355781

Alfons Geser

Publication date: 28 May 1997

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

Full work available at URL: https://semanticscholar.org/paper/25cf2619bb23dee3596a26e30d59fb3341a855cc

zbMATH Keywords

term rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Levels of undecidability in rewriting ⋮ An intuitionistic version of Ramsey's theorem and its use in program termination ⋮ Relative undecidability in term rewriting. I: The termination hierarchy ⋮ Relative undecidability in term rewriting. II: The confluence hierarchy

This page was built for publication: Omega-termination is undecidable for totally terminating term rewriting systems