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

This paper considers the relations among L -fuzzy sets, rough sets and hyperring theory. Based on a complete residuated lattice, the concept of (invertible) L-fuzzy hyperideals of a hyperring is introduced and some related properties are presented. The notions of lower and upper L-fuzzy rough approximation operators with respect to an L-fuzzy hyperideal are provided and some significant propert...

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

This paper deals with the concept of complete residuated lattice-valued (referred to as L-valued) finite tree automata. In this regard, we first define an L-valued regular tree language, and then we prove a necessary and sufficient condition for the regularity of an L-valued tree language. Furthermore, we generalize the pumping lemma for L-valued finite tree automata (L-FTA). Afterwards, the be...