✦ LIBER ✦

The Termination Hierarchy for Term Rewriting

✍ Scribed by H. Zantema

Book ID: 105867717
Publisher: Springer
Year: 2001
Tongue: English
Weight: 97 KB
Volume: 12
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s002000100061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Relative Undecidability in Term Rewritin

Relative Undecidability in Term Rewriting: I. The Termination Hierarchy

✍ Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Modular term rewriting systems and the t

Modular term rewriting systems and the termination

✍ Masahito Kurihara; Ikuo Kaji 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 313 KB

Total Termination of Term Rewriting is U

Total Termination of Term Rewriting is Undecidable

✍ Hans Zantema 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 537 KB

Relative Undecidability in Term Rewritin

Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy

✍ Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Counterexamples to termination for the d

Counterexamples to termination for the direct sum of term rewriting systems

✍ Yoshihito Toyama 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Omega-Termination is Undecidable for Tot

Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems

✍ Alfons Geser 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 601 KB

We give a complete proof of the fact that the following problem is undecidable: Given: A term rewriting system, where the termination of its rewrite relation is provable by a total reduction order on ground terms, Wanted: Does there exist a strictly monotonic interpretation in the positive integers