𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Term Rewrite Systems for Lattice Theory

✍ Scribed by Ralph Freese; J. Ježek; J.B. Nation

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
367 KB
Volume
16
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

It is shown that, even though there is a very well-behaved, natural normal form for lattice theory, there is no finite, convergent (A C) term rewrite system for the equational theory of all lattices.

📜 SIMILAR VOLUMES

Confluence of Curried Term-Rewriting Sys
Confluence of Curried Term-Rewriting Systems
✍ Stefan Kahrs 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 721 KB

Term rewriting systems operate on first-order terms. Presenting such terms in curried form is usually regarded as a trivial change of notation. However, in the absence of a type-discipline, or in the presence of a more powerful type-discipline than simply typed \(\lambda\)-calculus, the change is no

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