Skip to main content
Log in

Equational Bases for Joins of Residuated-lattice Varieties

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

Given a positive universal formula in the language of residuated lattices, we construct a recursive basis of equations for a variety, such that a subdirectly irreducible residuated lattice is in the variety exactly when it satisfies the positive universal formula. We use this correspondence to prove, among other things, that the join of two finitely based varieties of commutative residuated lattices is also finitely based. This implies that the intersection of two finitely axiomatized substructural logics over FL + is also finitely axiomatized. Finally, we give examples of cases where the join of two varieties is their Cartesian product.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Anderson, M., and T. Feil, Lattice-ordered groups: an introduction, D. Reidel Publishing Company, 1988.

  2. Bahls, P., J. Cole, N. Galatos, P. Jipsen, and C. Tsinakis, ‘Cancellative residuated lattices’, Algebra Universalis, to appear.

  3. Burris, S., and H. P. Sankappanavar, A Course in Universal Algebra, Graduate Texts in Mathematics, v. 78, Springer-Verlag, 1981.

  4. Blount, K., and C. Tsinakis, ‘The structure of residuated lattices’, Internat. J. Algebra Comput., to appear.

  5. Galatos, N., ‘Minimal varieties of residuated lattices’, preprint.

  6. Galatos, N., and H. Oono, ‘Substructural logics: Algebraization and Glivenko's theorem’, in preparation.

  7. Galatos, N., and C. Tsinakis, ‘Generalized MV-algebras’, in preparation.

  8. Jipsen, P., and C. Tsinakis, ‘A survey of residuated lattices’, Ordered Algebraic Structures (J. Martinez, ed.), Kluwer Academic Publishers, Dordrecht, 2002, pp. 19-56.

    Google Scholar 

  9. Ono, H., ‘Semantics for substructural logics’, Substructural logics (Tübingen, 1990), 259-291, Stud. Logic Comput. 2, Oxford Univ. Press, New York, 1993.

    Google Scholar 

  10. Ono, H., and M. Komori, ‘Logics without the contraction rule’, J. Symbolic Logic 50 (1985), 169-201.

    Google Scholar 

  11. Ward, M., and R. P. Dilworth, ‘Residuated lattices’, Trans. Amer. Math. Soc. 45 (1939), 335-354.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Galatos, N. Equational Bases for Joins of Residuated-lattice Varieties. Studia Logica 76, 227–240 (2004). https://doi.org/10.1023/B:STUD.0000032086.42963.7c

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:STUD.0000032086.42963.7c

Navigation