[Submit a comment] [RTALooP home] [Index] [Previous] [Next] [Postscript] [PDF] [BibTeX Source] [LaTeX Source]


Problem #77 (Solved !)

Originator: Freese
Date: June 1993

Summary: Is there a finite, normal form, associative-commutative term-rewriting system for lattices?

Remark

J Jezek, J. B. Nation, and R. Freese [Fre93] have shown that there is no finite, normal form, associative-commutative term-rewriting system for lattices. This is somewhat surprising because every lattice term is equivalent under lattice theory to a shortest term which is unique up to associativity and commutativity (known as “Whitman canonical form”).

References

[Fre93]
R. Freese. personal communication, 1993.

[Submit a comment] [RTALooP home] [Index] [Previous] [Next] [Postscript] [PDF] [BibTeX Source] [LaTeX Source]