Abstract
A very simple proof of the finite embeddability property for residuated distributive-lattice-ordered groupoids and some related classes of structures is presented. In particular, this gives an answer to the question, posed by Blok and van Alten, whether the class of residuated ordered groupoids has the property. The presented construction improves the computational-complexity upper bound of the universal theory of residuated distributive-lattice-ordered groupoids given by Buszkowski and Farulewski; for chains in the class, a tight bound is obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
