It is shown that the Boolean center of complemented elements in a bounded integral residuated lattice characterizes direct decompositions. Generalizing both Boolean products and poset sums of residuated lattices, the concepts of poset product, Priestley product and Esakia product of algebras are defined and used to prove decomposition theorems for various ordered algebras. In particular, we sho...

Multi-adjoint concept lattices were introduced [2,3] as a new general approach to formal concept analysis, in which the philosophy of the multi-adjoint paradigm [1,4] to formal concept analysis is applied. With the idea of providing a general framework in which different approaches could be conveniently accommodated, the authors worked in a general non-commutative environment; and this naturall...

Recently we proposed a new type of fuzzy integrals defined over complete residuated lattices. These integrals are intended for the modeling of type ⟨1, 1⟩ fuzzy quantifiers. An interesting theoretical question is, how to introduce various notions of convergence of this type of fuzzy integrals. In this contribution, we would like to present some results on strong and pointwise convergence of the...

The concept of a Kleene algebra (sometimes also called lattice) was already generalized by the first author for non-distributive lattices under name pseudo-Kleene algebra. We extend these concepts to posets and show how (pseudo-)Kleene can be characterized identities implications assigned commutative meet-directoids. Moreover, we prove that Dedekind-MacNeille completion poset is finite Further,...

A wrong argument in the proof of one of the main results in the paper is corrected. The result itself remains true. The right proof incorporates the basic ideas in the originally alleged proof, but in a more restricted construction. The proof of the last implication in Theorem 4.4 of the referenced paper [1] is wrong. At a certain point, it performs a construction on an arbitrary algebra but th...

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

In this paper, the concept of intuitionistic fuzzy congruence relation on a residuated lattice is introduced and its properties is studied. The relationship between intuitionistic fuzzy filters and intuitionistic fuzzy congruence relations on a residuated lattice is obtain. Then the intuitionistic fuzzy congruence relation corresponding to a given intuitionistic fuzzy filter on residuated latti...

In Section 2 replace the definition of ∗◦Q in Definition 1 by x∗◦Q y = inf{u ∗◦ v | u > x, v > y}. It is defined only if the infimum exists. Proposition 1 remains unchanged. Theorem 0. Let (X, ∗◦,→∗◦,≤) be a commutative residuated semigroup on a complete chain equipped with the order topology. Let a, b, c ∈ X be such that a = b→∗◦ c. Let (x, y) ∈ X × X be such that 1. neither x nor y equals the...

This paper studies the DeductionDetachment Theorem (DDT) in the realm of logics associated with bounded, commutative and integral residuated lattices whose consequence relation preserves degrees of truth (strictly speaking, it preserves the lower bounds of truth values of the premises). It is given some necessary conditions that must enjoy the varieties with a logic having the DDT. In two parti...