Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids

10/12/2019

∙

by   Dmitry Shkatov, et al.

∙

0

∙

share

We prove that the universal theory and the quasi-equational theory of bounded residuated distributive lattice-orderegroupoids are both EXPTIME-complete. Similar results areproven for bounded distributive lattices with a unary or binary operator and for some special classes of bounded residuated distributive lattice-ordered groupoids.