Explore chapters and articles related to this topic
New construction approaches of uninorms on bounded lattices
Published in International Journal of General Systems, 2021
Gül Deniz Çaylı
A lattice (Birkhoff 1967) is a nonempty set L equipped with a partial order ≤ such that any two elements x and y have a greatest lower bound (called meet or infimum), denoted by , as well as a smallest upper bound (called join or supremum), denoted by . For , the symbol a<b means that and . The elements a and b in L are comparable if or b<a. Otherwise, a and b are incomparable, in this case we use the notation . For the fixed element a in L, the set of all with will be denoted by i.e. The transpose of a partial order ≤ of a lattice L, denoted by ≥, i.e. if and only if , is also a partial order on L and the meet and the join with respect to ≥ are ∨ and ∧, respectively. That is to say, is also a lattice, called the dual lattice of .