Article history: Received 15 January 2015 Received in revised form 4 June 2015 Accepted 26 July 2015 Available online 7 August 2015

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.

In this paper, we study the separtion axioms T0, T1, T2 and T5/2 on topological and semitopological residuated lattices and we show that they are equivalent on topological residuated lattices. Then we prove that for every infinite cardinal number α, there exists at least one nontrivial Hausdorff topological residuated lattice of cardinality α. In the follows, we obtain some conditions on (semi)...

Abstract Generalized orthomodular posets were introduced recently by D. Fazio, A. Ledda and the first author of present paper in order to establish a useful tool for studying logic quantum mechanics. They investigated structural properties these posets. In paper, we study logical algebraic particular, investigate conditions under which they can be converted into operator residuated structures. ...

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...