Word problem for knotted residuated lattices. (Q2254319): Difference between revisions

This paper deals with the word problem for the variety \(RL(m,n)\) of residuated lattices axiomatized by the extra equation \(x^m\leq x^n\). Negative results are shown for \(1\leq m<n\) and \(2\leq n<m\). It is also proved that some varieties of distributive residuated lattices axiomatized by \(x^m\leq x^n\) have undecidable word problem. The proof yields a negative answer to Problem 4.5 in the paper by \textit{W. J. Blok} and \textit{C. J. van Alten} [Trans. Am. Math. Soc. 357, No. 10, 4141-4157 (2005; Zbl 1083.06013)]. The problem asked whether join-semilattice-ordered residuated semigroups axiomatized by \(x^n=x^{n+1}\) have the finite embeddability property for \(n\geq 2\).