Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
Logic
2019-10-17 v1 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1910.05556,
title = {Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids},
author = {Dmitry Shkatov and C. J. Van Alten},
journal= {arXiv preprint arXiv:1910.05556},
year = {2019}
}