Equational bases for joins of residuated-lattice varieties

Studia Logica 76 (2):227 - 240 (2004)
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.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.1023/B:STUD.0000032086.42963.7c
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 22,062
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

View all 7 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

18 ( #216,683 of 1,934,588 )

Recent downloads (6 months)

7 ( #76,855 of 1,934,588 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.