We show that a commutative bounded integral orthomodular lattice is residuated iff it is a Boolean algebra. This result is a consequence of [7, Theorem 7.31]; however, our proof is independent and uses other instruments.

Gentzen systems are introduced for Spinks and Veroff’s substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has been shown by Spinks and Veroff in [9], [10] that the variety of Nelson algebras, the algebras of constructive logic with strong negation N, is term-equivalent to a certain variety of bounded commutative residuated lattices ...

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

Cancellative residuated lattices are a natural generalization of lattice-ordered groups (`-groups). Although cancellative monoids are defined by quasi-equations, the class CanRL of cancellative residuated lattices is a variety. We prove that there are only two commutative subvarieties of CanRL that cover the trivial variety, namely the varieties generated by the integers and the negative intege...

This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.

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

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

Georgescu and Iorgulescu [3] introduced pseudo-BCK-algebras (in a slightly different way) as a non-commutative generalization of BCK-algebras, in the sense that if →= , then the algebra (A,→, 1) is a BCK-algebra. Pseudo-BCK-algebras relate to (non-commutative) residuated lattices as BCK-algebras do to commutative residuated lattices; specifically, by [6], pseudoBCK-algebras are just the 〈→, , 1...

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

A generalized BL-algebra (or GBL-algebra for short) is a residuated lattice that satisfies the identities x ∧ y = ((x ∧ y)/y)y = y(y\(x∧ y)). It is shown that all finite GBL-algebras are commutative, hence they can be constructed by iterating ordinal sums and direct products of Wajsberg hoops. We also observe that the idempotents in a GBL-algebra form a subalgebra of elements that commute with ...