The Undecidability of the Word Problem for Distributive Residuated Lattices
Let A = (X|R) be a finitely presented algebra in a variety V. The algebra A is said to have an undecidable word problem if there is no algorithm that decides whether or not any two given words in the absolutely free term algebra Tv(X) represent the same element of A. If V contains such an algebra A, we say that it has an undecidable word problem. (It is well known that the word problem for the varieties of semigroups, groups and l-groups is undecidable.)
The main result of this paper is the undecidability of the word problem for a range of varieties including the variety of distributive residuated lattices and the variety of commutative distributive ones. The result for a subrange, including the latter variety, is a consequence of a theorem by Urquhart . The proof here is based on the undecidability of the word problem for the variety of semigroups and makes use of the concept of an n-frame, introduced by von Neumann. The methods in the proof extend ideas used by Lipshitz and Urquhart to establish undecidability results for the varieties of modular lattices and distributive latticeordered semigroups, respectively.
KeywordsWord Problem Residuated Lattice Modular Lattice Lattice Reduct Multiplicative Semigroup
Unable to display preview. Download preview PDF.
- K. Blount and C. Tsinakis, The structure of residuated lattices. Preprint.Google Scholar
- H. Andréka, S. Givant and I. Németi, Decision Problems for Equational Theories of Relation Algebras. Memoirs of the AMS 126 (604) (1997).Google Scholar
- P. Schroeder and K. Dosen (Eds.), Substructural Logics. Clarendon Press, Oxford, (1993).Google Scholar
- P. Jipsen and C. Tsinakis, A survey of residuated lattices. In these Proceedings, 19–56.Google Scholar