Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
From MaRDI portal
Publication:6327061
DOI10.1007/S00012-019-0609-1zbMath1523.06003arXiv1910.05556MaRDI QIDQ6327061
Dmitry Shkatov, Clint J. van Alten
Publication date: 12 October 2019
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Ordered structures (06F99) Distributive lattices (06D99)
This page was built for publication: Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids