2000 character limit reached
Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids (1910.05556v1)
Published 12 Oct 2019 in math.LO and cs.LO
Abstract: 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.