Finite Embeddability Property for Residuated Lattices via Regular Languages
Abstract
Let V be a variety of residuated lattices axiomatized by a set of identities in the language {∨,⋅,1} . We characterize when V has the finite embeddability property via regularity of a certain collection of languages. Several applications of this characterization are presented.