On the Word Problem for Free Lattices

Struth, Georg

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the Word Problem for Free Lattices

MPS-Authors

/persons/resource/persons45565

Struth, Georg
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Struth, G. (1997). On the Word Problem for Free Lattices. In H. Comon (Ed.), Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97) (pp. 128-141). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-39F1-0

Abstract

We prove completeness of a rewrite-based algorithm for the word problem in the variety of lattices and discuss the method of non-symmetric completion with regard to this variety.