The class of all MTL-algebras is a variety, denoted MTL. Alternatively, an MTL-algebra is a representable, commutative, integral residuated lattice with a least element.

We show that the equational theory of representable lattice-ordered residuated semigroups is not finitely axiomatizable. We apply this result to the problem of completeness of substructural logics.

In this paper we define, inspired by ring theory, the class of maximal residuated lattices with lifting Boolean center and prove a structure theorem for them: any maximal residuated lattice with lifting Boolean center is isomorphic to a finite direct product of local residuated lattices. MSC: 06F35, 03G10.

The theory of residuated lattices, first proposed by Ward and Dilworth [4], is formalised in Isabelle/HOL. This includes concepts of residuated functions; their adjoints and conjugates. It also contains necessary and sufficient conditions for the existence of these operations in an arbitrary lattice. The mathematical components for residuated lattices are linked to the AFP entry for relation al...

We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of substructural logics. Our approach is algebraic and uses residuated lattices, the algebraic models for substructural logics. We generalize the notion of the ordinal sum of two residuated lattices and use it to obtain...

My primary and current research work is in the general spirit of algebras of logic, lattice theory, hyper structures and applications. A partially ordered set, or poset for short is a pair (P, ≤) where P is a set and ≤ a partial order on P. A poset (P, ≤) is called a lattice if every pair x, y ∈ P has a least upper bound x ∨ y and a greatest lowest bound x ∧ y in P. A lattice is bounded if it h...

In this paper, the notions of fuzzy soft subalgebra and fuzzy soft convex subalgebra of a residuated lattice are introduced and some related properties are investigated. Then, we define fuzzy soft congruence on a residuated lattice and obtain the relation between fuzzy soft convex subalgebras and fuzzy soft congruence relations on residuated lattices. The concept of soft homomorphism is defined...

It is known that classical logic CL is the single maximal consistent logic over intuitionistic logic Int, which is moreover the single one even over the substructural logic FLew. On the other hand, if we consider maximal consistent logics over a weaker logic, there may be uncountablymany of them. Since the subvariety lattice of a given variety V of residuated lattices is dually isomorphic to th...

We introduce a new product bilattice construction that generalizes the well-known one for interlaced bilattices and others that were developed more recently, allowing to obtain a bilattice with two residuated pairs as a certain kind of power of an arbitrary residuated lattice. We prove that the class of bilattices thus obtained is a variety, give a finite axiomatization for it and characterize ...

By a symmetric residuated lattice we understand an algebra A = (A,∨,∧, ∗,→,∼, 1, 0) such that (A,∨,∧, ∗,→, 1, 0) is a commutative integral bounded residuated lattice and the equations ∼∼ x = x and ∼ (x ∨ y) =∼ x∧ ∼ y are satisfied. The aim of the paper is to investigate properties of the unary operation ε defined by the prescription εx :=∼ x → 0. We give necessary and sufficient conditions for ...