In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...

Right-residuated binars and right-divisible residuated binars are defined as precursors of generalized hoops, followed by some results and open problems about these partially ordered algebras. Next we show that all complete homomorphic images of a complete residuated lattice A can be constructed easily on certain definable subsets of A. Applying these observations to the algebras of Hajek’s Bas...

Ward and Dilworth 1 introduced the concept of residuated lattices as generalization of ideal lattices of rings. The residuated lattice plays the role of semantics for a multiple-valued logic called residuated logic. Residuated logic is a generalization of intuitionistic logic. Therefore it is weaker than classical logic. Important examples of residuated lattices related to logic are Boolean alg...

Proposition 3. If A=〈A,∧,∨, ·, \, /, 1, γ〉 is a residuated lattice with a nucleus γ, then the algebra Aγ=〈Aγ ,∧,∨γ , ·γ , \, /, γ(1)〉 is a residuated lattice, where Aγ=γ[A] and for all x, y ∈ Aγ , x ∨γ y=γ(x ∨ y) and x ·γ y=γ(x · y). For a variety V of residuated lattices with modal operators, consider V∗, the full subcategory of V consisting of those pairs 〈B, 〉 such that B generates B as a re...

In this paper, based on Hájek, Vychodil, Rachunek and Šalounová’s works, we study the concept of v-filters of residuated lattices with weak vt-operators, axiomatize very true operators, discuss filters and v-filters of residuated lattices with weak vt-operator, give the formulas for calculating the v-filters generated by subsets, and show that lattice of v-filters of a commutative residuated la...

A b s t r a c t. In this paper, we prove the semisimplicity of free biresiduated lattices, more precisely, integral residuated lattices. In [4], authors show that variety of residuated lattices, more precisely, commutative integral residuated lattices, is generated by its finite simple members. The result is obtained by showing that every free residuated lattice is semisimple and then showing t...

We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct. A residuated lattice is an algebra A = (A,∨,∧, ·, e, /, \) such that (A,∨,∧) is a lattice, (A, ·, e) is a monoid and for every a, b, c ∈ A ab ≤ c ⇔ a ≤ c/b ⇔ b ≤ a\c. The last condition is equivalent to the fact that (A,∨,∧, ·, e) is a lattice-ordered monoid and for every a, b ∈ A there is a great...

Petr Hájek identified the logic BL, that was later shown to be the logic of continuous t-norms on the unit interval, and defined the corresponding algebraic models, BL-algebras, in the context of residuated lattices. The defining characteristics of BL-algebras are representability and divisibility. In this short note we survey recent developments in the study of divisible residuated lattices an...

In this paper, the concept of intuitionistic fuzzy soft sets is applied to residuated lattices. The notion of intuitionistic fuzzy soft filters of a residuated lattice is introduced and some related properties are investigated. Then the representations of generated intuitionistic fuzzy soft filters are established. We prove that the lattice of all intuitionistic fuzzy soft filters of a residuat...

The commutative residuated lattices were first introduced by M. Ward and R.P. Dilworth as generalization of ideal lattices of rings. Non-commutative residuated lattices, called sometimes pseudo-residuated lattices, biresiduated lattices or generalized residuated lattices are algebraic counterpart of substructural logics, that is, logics which lack some of the three structural rules, namely cont...