Next Article in Journal
Statistical Formulation for Average Parameter Determination via Quantile-Linked Auxiliary Characteristics
Next Article in Special Issue
Fractal Modeling of Generalized Weighted Pre-Invex Functions with Applications to Random Variables and Special Means
Previous Article in Journal
The Existence and Uniqueness of Mild Solutions for Fuzzy Hilfer Fractional Evolution Equations with Non-Local Conditions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Element-Oriented Construction Methods for Nullnorms on Bounded Lattices

1
Department of Mathematics, Karadeniz Technical University, Trabzon 61080, Turkey
2
Department of Mathematics and Descriptive Geometry, Faculty of Civil Engineering, Slovak University of Technology, Radlinského 11, 810 05 Bratislava, Slovakia
3
CE IT4Innovations—IRAFM, University of Ostrava, 701 03 Ostrava, Czech Republic
*
Authors to whom correspondence should be addressed.
Axioms 2025, 14(12), 856; https://doi.org/10.3390/axioms14120856
Submission received: 16 October 2025 / Revised: 6 November 2025 / Accepted: 19 November 2025 / Published: 21 November 2025

Abstract

Nullnorms are aggregation functions with an annihilator and are generalizations of t-norms and t-conorms. After the introduction of the concept of nullnorms on bounded lattices by Karaçal et al., the studies on their construction methods in such structures have been initiated. Following the paper of Karaçal and Şanlı, in which proposed element-based construction methods for t-norms and t-conorms on bounded lattices, a natural research question emerged: Are there any element-based construction methods for nullnorms on a bounded lattice L? In this paper, we address this question and propose construction methods for nullnorms with an annihilator element k L { 0 , 1 } , depending on an element η L { 0 , k , 1 } , by examining the relationship between η and k. The proposed methods are compared with some existing approaches in the literature and are shown to be distinct. These theoretical findings are further supported with illustrative examples.
MSC:
03E72; 03B52; 03G10

1. Introduction

Nullnorms and t-operators were first introduced on the unit interval by Calvo et al. [1] and Mas et al. [2], and it was proven that they are equivalent on the unit interval in [3]. These operators are crucial in a wide range of fields, including fuzzy logic, fuzzy quantifiers, decision making, expert systems, and neural networks. Nullnorms are generalizations of t-norms and t-conorms since they allow the annihilator element k to be chosen from anywhere on the unit interval, and they are t-norms when k = 0 and t-conorms when k = 1 . Nullnorms on the unit interval were discussed in many papers [4,5,6].
Karaçal et al. [7] introduced the concept of nullnorms with an annihilator element k L { 0 , 1 } on the bounded lattice L based on the fact that a t-norm (or t-conorm) always exists on any bounded lattice L. While nullnorms are widely discussed in the literature [8,9,10,11,12,13,14,15,16,17], element-oriented construction methods for nullnorms on bounded lattices remain underexplored. This paper addresses this gap by proposing such methods for nullnorms on bounded lattices.
The paper is structured as follows. In Section 2, we review the concepts of bounded lattices, t-norms, t-conorms and nullnorms on bounded lattices. Section 3 presents the main results including the new element-based construction methods for nullnorms on a bounded lattice L based on the element η by elaborating η I k , η ( k , 1 ) or η ( 0 , k ) . To exemplify these construction methods, we present several examples. Moreover, we demonstrate through the examples that our new construction methods differ from previously proposed methods.

2. Notations, Definitions and a Review of Previous Results

This section reviews related concepts.
Definition 1
([18]). The elements p and q in a bounded lattice L are called comparable if p q or q p ; otherwise, they are called incomparable and notated by p | | q , and also the set I a = { p L : p | | a } is defined.
Definition 2
([19]). A triangular norm (conorm) T (S) on a bounded lattice L, shortly t-norm (t-conorm), is an L 2 L increasing function satisfying commutativity, associativity and having a neutral element 1 (0).
Definition 3
([7]). A nullnorm F : L 2 L is a commutative, associative, non-decreasing function having an element k L such that F ( p , 0 ) = p for all p [ 0 , k ] , F ( p , 1 ) = p for all p [ k , 1 ] , which is an annihilator (zero element) for F.
We recommend refs. [7,9,14,17] for more details about nullnorms on bounded lattices.

3. Element-Based Construction Methods of Nullnorms on Bounded Lattices

In this section, keeping in mind the paper of Karaçal and Şanlı in [20], in which they presented an element-based triangular norm construction, we introduce three nullnorms construction methods on a bounded lattice L in Theorems 1, 3 and 4, based on an arbitrary element η { 0 , k , 1 } . Then, we compare our methods with those methods already in the literature and highlight the differences between our approach and the recalled ones. Finally, we provide some illustrative examples.
In the following theorem, Formula (1) produces a nullnorm on the bounded lattice L satisfying p < q for all p [ 0 , k ) , q I k when η I k is a fixed element. We can obtain the following nullnorm construction method by considering the t-conorm S on [ 0 , k ] satisfying S ( η k , η k ) = η k and the t-norm T on [ k , 1 ] .
Theorem 1.
Let k L { 0 , 1 } be an element of bounded lattice L, η I k , S be a t-conorm on [ 0 , k ] satisfying S ( η k , η k ) = η k and T be a t-norm on [ k , 1 ] . If p < q for all p [ 0 , k ) , q I k , then the function Z 1 : L 2 L defined by
Z 1 ( p , q ) = S ( p , q ) i f ( p , q ) [ 0 , k ) 2 , T ( p , q ) i f ( p , q ) [ k , 1 ] 2 , η k i f ( p , q ) ( [ 0 , k ) I k ) × I k I k × [ 0 , k ) , k o t h e r w i s e ,
is a nullnorm on L with the annihilator element k.
Proof. 
By the definition of the function Z 1 , it is clear that Z 1 is a commutative function with the annihilator element k. Now, in the following, let us check that the monotonicity and associativity hold.
(i)
Monotonicity: Let us show that for all elements p , q L with p q , Z 1 ( p , r ) Z 1 ( q , r ) for all r L . If p and q are both elements of [ 0 , k ) or { k } or ( k , 1 ] or I k , Z 1 ( p , r ) Z 1 ( q , r ) is always satisfied for all r L since p q . Then, the proof then considers all of the remaining cases.
1.
Let p [ 0 , k ) .
(1.1)
q = k   ( q ( k , 1 ] ) ,
(1.1.1)
If r [ 0 , k ) , then Z 1 ( p , r ) = S ( p , r ) k = Z 1 ( q , r ) .
(1.1.2)
If r [ k , 1 ] , then Z 1 ( p , r ) = k ( T ( q , r ) ) = Z 1 ( q , r ) .
(1.1.3)
If r I k , then Z 1 ( p , r ) = η k k = Z 1 ( q , r ) .
(1.2)
q I k ,
(1.2.1)
If r [ 0 , k ) , then Z 1 ( p , r ) = S ( p , r ) η k = Z 1 ( q , r ) .
(1.2.2)
If r [ k , 1 ] , then Z 1 ( p , r ) = k = Z 1 ( q , r ) .
(1.2.3)
If r I k , then Z 1 ( p , r ) = η k = Z 1 ( q , r ) .
2.
Let p = k ,
(2.1)
q ( k , 1 ] ,
(2.1.1)
If r [ 0 , k ] I k , then Z 1 ( p , r ) = k = Z 1 ( q , r ) .
(2.1.2)
If r [ k , 1 ] , then Z 1 ( p , r ) = k T ( q , r ) = Z 1 ( q , r ) .
3.
Let p I k ,
(3.1)
q ( k , 1 ] ,
(3.1.1)
If r [ 0 , k ) I k , then Z 1 ( p , r ) = η k k = Z 1 ( q , r ) .
(3.1.2)
If r [ k , 1 ] , then Z 1 ( p , r ) = k T ( q , r ) = Z 1 ( q , r ) .
(ii)
Associativity: We demonstrate that Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( Z 1 ( p , q ) , r ) for all p , q , r L . If p = k , the equality is satisfied; therefore, they are omitted. Again, taking that Z 1 is commutative into account for that proof, we consider all of the remaining cases as follows.
1.
Let p [ 0 , k ) .
(1.1)
q [ 0 , k ) ,
(1.1.1)
If r [ 0 , k ) , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , S ( q , r ) ) = S ( p , S ( q , r ) ) = S ( S ( p , q ) , r ) = Z 1 ( S ( p , q ) , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(1.1.2)
If r ( k , 1 ] , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , k ) = k = Z 1 ( S ( p , q ) , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(1.1.3)
If r I k , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , η k ) = S ( p , η k ) = η k = Z 1 ( S ( p , q ) , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(1.2)
q ( k , 1 ] ,
(1.2.1)
If r [ 0 , k ) I k , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , k ) = k = Z 1 ( k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(1.2.2)
If r ( k , 1 ] , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , T ( q , r ) ) = k = Z 1 ( k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(1.3)
q I k ,
(1.3.1)
If r [ 0 , k ) , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , η k ) = S ( p , η k ) = η k = S ( η k , r ) = Z 1 ( η k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(1.3.2)
If r ( k , 1 ] , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , k ) = k = Z 1 ( η k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(1.3.3)
If r I k , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , η k ) = S ( p , η k ) = η k = Z 1 ( η k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
2.
Let p ( k , 1 ] .
(2.1)
y [ 0 , k ) ,
(2.1.1)
If r ( k , 1 ] , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , k ) = k = Z 1 ( k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(2.1.2)
If r I k , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , η k ) = k = Z 1 ( k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(2.2)
q ( k , 1 ] ,
(2.2.1)
If r I k , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , k ) = k = Z 1 ( T ( p , q ) , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(2.2.2)
If r ( k , 1 ] , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , T ( q , r ) ) = T ( p , T ( q , r ) = T ( T ( p , q ) , r ) = Z 1 ( T ( p , q ) , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(2.3)
q I k ,
(2.3.1)
If r I k , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , η k ) = k = Z 1 ( k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(2.3.2)
If r ( k , 1 ] , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , k ) = k = Z 1 ( k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
3.
Let p I k .
(3.1)
q [ 0 , k ) ,
(3.1.1)
If r I k , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , η k ) = η k = Z 1 ( η k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(3.2)
q ( k , 1 ] ,
(3.2.1)
If r I k , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , k ) = k = Z 1 ( k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
(3.3)
q I k ,
(3.3.1)
If r I k , then Z 1 ( p , Z 1 ( q , r ) ) = Z 1 ( p , η k ) = η k = Z 1 ( η k , r ) = Z 1 ( Z 1 ( p , q ) , r ) .
Therefore, Z 1 is a nullnorm on L, whose annihilator element is k. □
The structure of the nullnorm Z 1 given in Formula (1) is summarized in Figure 1.
To illustrate Theorem 1, we provide the following example.
Example 1.
Let us consider ( L 1 = { 0 , k , p , t , x , η , 1 } , ) as shown in Figure 2; then, the nullnorm Z 1 on L 1 with annihilator element k is calculated as in Table 1, when T = T D and S = S D .
By considering T = T and S = S in Theorem 1, the following Corollary 1 is obtained.
Corollary 1.
Let k L { 0 , 1 } be an element of bounded lattice L and η I k . If p < q for all p [ 0 , k ) , q I k , then the function Z 1 : L 2 L defined by
Z 1 ( p , q ) = p q i f ( p , q ) [ 0 , k ) 2 , p q i f ( p , q ) [ k , 1 ] 2 , η k i f ( p , q ) ( [ 0 , k ) I k ) × I k I k × [ 0 , k ) , k o t h e r w i s e ,
is a nullnorm on L with the annihilator element k.
The structure of the nullnorm Z 1 given in Formula (2) is summarized in Figure 3.
Remark 1.
In Theorem 1, even if Formula (1) results in a nullnorm on the bounded lattice L, the lattice L may not satisfy p < q for all p [ 0 , k ) , q I k . The function Z 1 in Theorem 1 is a nullnorm with the annihilator element k on the bounded lattice L. We illustrate this argument by an example as follows. In the following example, it is clear that the lattice L 2 does not satisfy the required conditions, even Z 1 is a nullnorm on L 2 .
Example 2.
Consider the bounded lattice ( L 2 = { 0 , g , k , l , t , η , 1 } , ) characterized by the Hasse diagram in Figure 4. It is clear that g [ 0 , k ) , t I k and g t while the operator Z obtained by Formula (1) and given in Table 2 is a nullnorm with the annihilator element k on the bounded lattice L 2 , when T = T and S = S .
Remark 2.
Observe that Formula (1) given in Theorem 1 may not construct a nullnorm on a bounded lattice L that does not satisfy the condition p < q for all p [ 0 , k ) and q I k given in Theorem 1; i.e., the condition can not be omitted in general. In the following, in order to show this fact, we give an example of a bounded lattice having some elements p [ 0 , k ) , q I k such that p q , on which the operator Z 1 is not a nullnorm.
Example 3.
Consider the bounded lattice ( L 3 = { 0 , k , m , p , q , t , η , 1 } , ) described in Figure 5.
It is seen that m η and m p for the elements m [ 0 , k ) and η , p I k . Considering the Formula (1) in Theorem 1, for the function Z 1 on L 3 , we obtain Z 1 ( m , 0 ) = S ( m , 0 ) = m 0 = η k = Z 1 ( q , 0 ) when m < q for the elements m , q L 3 . So, the monotonicity is violated. Therefore, Z 1 is not a nullnorm on L 3 .
In general, the nullnorm Z 1 defined in Theorem 1 is different from the nullnorms V k ( S ) , V k ( T ) , V T S , R , V S T , F , F T , F S , V S T and V T S in refs. [7,9,14,17]. We illustrate this argument by the following Examples 4 and 5.
Example 4.
Consider the bounded lattice ( L 4 = { 0 , f , g , h , i , j , k , 1 } , ) characterized by the Hasse diagram in Figure 6.
By using the construction methods in refs. [7,9,14,17] and Theorem 1 and put h = η T = T and S = S , we have the following:
  • V k ( S ) ( j , j ) = k j = j j = Z 1 ( j , j ) ,
  • V k ( T ) ( g , i ) = k i = g i = Z 1 ( g , i ) ,
  • V S T , F ( h , f ) = F ( h k , f k ) = F ( 1 , 1 ) c = Z 1 ( h , f ) (Since F ( 1 , 1 ) [ k , 1 ] ) ,
  • F T ( f , j ) = j k = Z 1 ( f , j ) ,
  • V S T ( g , f ) = k i = h k = Z 1 ( g , f ) .
Therefore, it is clear that the nullnorm Z 1 defined by Formula (1) in Theorem 1 is different from the nullnorms V k ( S ) , V k ( T ) , V S T , F , F T and V S T given in refs. [7,9,14,17].
Example 5.
Consider the lattice ( L 5 = { 0 , k , p , t , x , y , z , 1 } , ) described in Figure 7.
Let us apply the construction methods in refs. [7,9,14,17] and Theorem 1 and put z = η , T = T and S = S ; then, we have the following:
  • V T S , R ( x , p ) = R ( x k , p k ) = R ( x , 0 ) 0 = z k = Z 1 ( x , p ) (since R ( x , 0 ) [ x , k ] ),
  • F S ( x , p ) = x 0 = z k = Z 1 ( x , p ) ,
  • V T S ( x , p ) = S ( x k , p k ) = S ( x , 0 ) = x 0 = z k = Z 1 ( x , p ) (since S ( x , 0 ) [ x , k ] ).
Thus, it is clearly seen that the nullnorm Z 1 defined by Formula (1) in Theorem 1 is different from the nullnorms V T S , R , F S and V T S given in refs. [9,14,17].
Remark 3.
It should be noted that the nullnorm Z 1 obtained by Formula (1) and the nullnorm V k ( S ) obtained by Theorem 4 in [7] are the same whenever the t-norm T = T D on [ k , 1 ] in Formula (1) and the t-conorm S on [ 0 , k ] in Theorem 4 in [7] satisfies the condition S ( η k , η k ) = η k and I k = { η } . 5Moreover, the nullnorm Z 1 obtained by Formula (1) coincides with the nullnorm V T S , R obtained by Theorem 3.2 in [17] if the t-subconorm R on [ 0 , k ] in Theorem 3.2 in [17] satisfies the condition R ( η k , η k ) = η k . In addition, the nullnorm Z 1 obtained by Formula (1) coincides with and the nullnorm V T S obtained by Theorem 6 in [14] when the t-conorm S on [ 0 , k ] in Theorem 6 in [14] satisfies the condition S ( η k , η k ) = η k and I k = { η } .
Based on the element-based construction approach provided by Formula (3) in Theorem 2, which relies on the existence of the element η I k , we can derive another nullnorm construction method, acquired by considering a t-norm T on the interval [ k , 1 ] such that T ( η k , η k ) = η k , and the t-conorm S on the interval [ 0 , k ] .
Theorem 2.
Let ( L , , 0 , 1 ) be a bounded lattice, k L { 0 , 1 } , η I k , S be a t-conorm on [ 0 , k ] and T be a t-norm on [ k , 1 ] satisfying T ( η k , η k ) = η k . If p < q  for all p I k , q ( k , 1 ] , then the function Z 2 : L 2 L defined by
Z 2 ( p , q ) = S ( p , q ) i f ( p , q ) [ 0 , k ) 2 , T ( p , q ) i f ( p , q ) [ k , 1 ] 2 , η k i f ( p , q ) ( ( k , 1 ] I k ) × I k I k × ( k , 1 ] , k o t h e r w i s e ,
is a nullnorm on L with the annihilator element k.
Proof. 
The proof follows easily from Theorem 1, and therefore it is omitted. □
The structure of the nullnorm Z 2 given in Formula (3) is summarized in Figure 8.
Example 6.
Consider the bounded lattice from Example 3, i.e., ( L 3 = { 0 , k , m , p , q , t , η , 1 } , ) as shown in Figure 5; then, the nullnorm Z 2 on L 3 with annihilator element k is obtained as in Table 3 when T = T and S = S W .
By considering T = T and S = S in Theorem 2, the following Corollary 2 is obtained.
Corollary 2.
Let ( L , , 0 , 1 ) be a bounded lattice, k L { 0 , 1 } and η I k . If p < q for all p I k , q ( k , 1 ] , then the function Z 2 : L 2 L defined by
Z 2 ( p , q ) = p q ( p , q ) [ 0 , k ) 2 , p q ( p , q ) [ k , 1 ] 2 , η k ( p , q ) ( ( k , 1 ] I k ) × I k I k × ( k , 1 ] , k o t h e r w i s e ,
is a nullnorm on L with the annihilator element k.
The structure of the nullnorm Z 2 given in Formula (4) is summarized in Figure 9.
Remark 4.
Observe that Formula (3) given in Theorem 2 may construct a nullnorm on a bounded lattice L that does not satisfy the condition p < q for all p I k , q ( k , 1 ] given in Theorem 2. The function Z 2 is a nullnorm on L with the annihilator element k. In order to show this argument, in the following, an example of a bounded lattice not satisfying the mentioned condition is given in which the function Z 2 is a nullnorm defined by Formula (3) in Theorem 2.
Example 7.
Consider the bounded lattice ( L 6 = { 0 , k , p , r , y , η , 1 } , ) characterized by the Hasse diagram in Figure 10.
The lattice L 6 does not satisfy the condition of Theorem 2 since y I k and r ( k , 1 ] such that y k . The function Z obtained by Formula (3) in Theorem 2 and given in Table 4, when T = T and S = S W , is a nullnorm on the bounded lattice L 6 with the annihilator element k.
Remark 5.
It should be noted that the nullnorm Z 2 obtained by Formula (3) and the nullnorm V k ( T ) obtained by Theorem 4 in [7] are the same whenever the t-conorm S = S D on [ 0 , k ] in Formula (3), the t-norm T on [ k , 1 ] in Theorem 4 in [7] satisfies the condition T ( η k , η k ) = η k and I k = { η } . Moreover, the nullnorm Z 2 obtained by Formula (3) coincides with the nullnorm V S T , F ( V S T ) obtained by Theorem 3.3 (Theorem 6) in [17] ([14]), and the t-subnorm F (t- norm T) on [ k , 1 ] in Theorem 3.3 (Theorem 6) in [17] ([14]) satisfies the condition F ( η k , η k ) = η k ( T ( η k , η k ) = η k ) and I k = { η } .
Now, in the following, we introduce a construction method for nullnorms with the annihilator element k based on the element η ( 0 , k ) . Our construction method exploits the existence of a t-norm T on the subinterval [ 0 , k ] . It should be pointed out that our construction method does not need any constraints here.
Theorem 3.
Let ( L , , 0 , 1 ) be a bounded lattice, k L { 0 , 1 } , η ( 0 , k ) and T be a t-norm on [ k , 1 ] . Then, the function Z 3 : L 2 L defined by
Z 3 ( p , q ) = p q η i f ( p , q ) ( 0 , k ) 2 , T ( p , q ) i f ( p , q ) [ k , 1 ] 2 , p q i f ( p , q ) { 0 } × [ 0 , k ) [ 0 , k ) × { 0 } , k o t h e r w i s e ,
is a nullnorm on L with the annihilator element k.
Proof. 
By the definition of the function Z 3 , it is clear that Z 3 is a commutative function with the annihilator element k. Now, in the following, let us check that the monotonicity and associativity hold.
(i)
Monotonicity: Let us show that for all elements p , q L with p q , Z 3 ( p , r ) Z 3 ( q , r ) for all r L . If p and q are both elements of { 0 } or ( 0 , k ) or { k } or ( k , 1 ) or I k , Z 3 ( p , r ) Z 3 ( q , r ) is always satisfied for all r L since p q . If p = 1 or r I k , the inequality is satisfied; therefore, they are omitted. The proof then considers all of the remaining cases.
1.
Let p = 0 .
(1.1)
q ( 0 , k ) ,
(1.1.1)
If r = 0 , then Z 3 ( p , r ) = p r q r = Z 3 ( q , r ) .
(1.1.2)
If r ( 0 , k ) , then Z 3 ( p , r ) = p r q r η = Z 3 ( q , r ) .
(1.1.3)
If r [ k , 1 ) , then Z 3 ( p , r ) = k = Z 3 ( q , r ) .
(1.2)
q { k } I k ,
(1.2.1)
If r [ 0 , k ) , then Z 3 ( p , r ) = p r k = Z 3 ( q , r ) .
(1.2.2)
If r [ k , 1 ) , then Z 3 ( p , r ) = k = Z 3 ( q , r ) .
(1.3)
q ( k , 1 ) ,
(1.3.1)
If r [ 0 , k ) , then Z 3 ( p , r ) = p r k = Z 3 ( q , r ) .
(1.3.2)
If r [ k , 1 ) , then Z 3 ( p , r ) = k T ( q , r ) = Z 3 ( q , r ) .
2.
Let p ( 0 , k ) .
(2.1)
q { k } I k ,
(2.1.1)
If r = 0 , then Z 3 ( p , r ) = p r k = Z 3 ( q , r ) .
(2.1.2)
If r ( 0 , k ) , then Z 3 ( p , r ) = p r η k = Z 3 ( q , r ) .
(2.1.3)
If r [ k , 1 ) , then Z 3 ( p , r ) = k = Z 3 ( q , r ) .
(2.2)
q ( k , 1 ) ,
(2.2.1)
If r = 0 , then Z 3 ( p , r ) = p r k = Z 3 ( q , r ) .
(2.2.2)
If r ( 0 , k ) , then Z 3 ( p , r ) = p r η k = Z 3 ( q , r ) .
(2.2.3)
If r [ k , 1 ) , then Z 3 ( p , r ) = k T ( q , r ) = Z 3 ( q , r ) .
3.
Let p = k ,
(3.1)
q ( k , 1 ) ,
(3.1.1)
If r [ 0 , k ] , then Z 3 ( p , r ) = k = Z 3 ( q , r ) .
(3.1.2)
If r [ k , 1 ) , then Z 3 ( p , r ) = k T ( q , r ) = Z 3 ( q , r ) .
4.
Let p I k ,
(4.1)
q ( k , 1 ) ,
(4.1.1)
If r [ 0 , k ) , then Z 3 ( p , r ) = k = Z 3 ( q , r ) .
(4.1.2)
If r [ k , 1 ) , then Z 3 ( p , r ) = k T ( q , r ) = Z 3 ( q , r ) .
(ii)
Associativity: We demonstrate that Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( Z 3 ( p , q ) , r ) for all p , q , r L . If at least one of the elements p , q , r belongs to the set I k { k } , the equality is satisfied; therefore, they are omitted. Again, taking that Z 3 is commutative into account, the proof considers all of the remaining cases.
1.
Let p = 0 .
(1.1)
q = 0 ,
(1.1.1)
If r [ 0 , k ) , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , q r ) = p q r = Z 3 ( p q , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(1.1.2)
If r ( k , 1 ] , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , k ) = k = Z 3 ( p q , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(1.2)
q ( 0 , k ) ,
(1.2.1)
If r = 0 , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , q r ) = p q r = Z 3 ( p q , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(1.2.2)
If r ( 0 , k ) , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , q r η ) = p q r η = Z 3 ( p q , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(1.2.3)
If r ( k , 1 ] , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , k ) = k = Z 3 ( p q , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(1.3)
q ( k , 1 ] ,
(1.3.1)
If r [ 0 , k ) , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , k ) = k = Z 3 ( k , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(1.3.2)
If r ( k , 1 ] , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , T ( q , r ) ) = k = Z 3 ( k , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
2.
Let p ( 0 , k ) .
(2.1)
q = 0 ,
(2.1.1)
If r ( 0 , k ) , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , q r ) = p q r η = Z 3 ( p q , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(2.1.2)
If r ( k , 1 ] , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , k ) = k = Z 3 ( p q , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(2.2)
q ( 0 , k ) ,
(2.2.1)
If r ( 0 , k ) , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , q r η ) = p q r η = Z 3 ( p q η , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(2.2.2)
If r ( k , 1 ] , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , k ) = k = Z 3 ( p q η , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(2.3)
q ( k , 1 ] ,
(2.3.1)
If r ( 0 , k ) , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , k ) = k = Z 3 ( k , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(2.3.2)
If r ( k , 1 ] , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , T ( q , r ) ) = k = Z 3 ( k , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
3.
Let p ( k , 1 ] .
(3.1)
q = 0 ,
(3.1.1)
If r ( 0 , k ) , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , q r ) = k = Z 3 ( k , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(3.2)
q ( 0 , k ) ,
(3.2.1)
If r ( k , 1 ] , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , k ) = k = Z 3 ( k , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
(3.3)
q ( k , 1 ] ,
(3.3.1)
If r ( k , 1 ] , then Z 3 ( p , Z 3 ( q , r ) ) = Z 3 ( p , T ( q , r ) ) = T ( p , T ( q , r ) ) = T ( T ( p , q ) , r ) = Z 3 ( T ( p , q ) , r ) = Z 3 ( Z 3 ( p , q ) , r ) .
We conclude that Z 3 is a nullnorm on L with the annihilator element k. □
The structure of the nullnorm Z 3 given in Formula (5) is summarized in Figure 11.
Remark 6.
(i) If we take S ( p , q ) = p q 0 { p , q } p q η o t h e r w i s e and R ( p k , q k ) = k in ref. [17], the nullnorm V T S , R coincides with the nullnorm Z 3 obtained by Formula (5).
  • (ii) If we take S ( p , q ) = p q 0 { p , q } p q η o t h e r w i s e and F ( p k , q k ) = k in Formula [17], the nullnorm V s T , F coincides with the nullnorm Z 3 obtained by Formula (5).
Now, we give the following examples in order to show that the nullnorm Z 3 defined by Formula (5) in Theorem 3 is different from those nullnorms obtained by the construction methods in the literature in general.
Example 8.
Consider the bounded lattice from Example 4, i.e., ( L 4 = { 0 , f , g , h , i , j , k , 1 } , ) characterized by the Hasse diagram in Figure 6.
By using the construction methods in [7,9,14] and Theorem 3 and putting g = η , T = T as taken, we obtain the following:
  • V k ( S ) ( j , j ) = k j = j j = T ( j , j ) = Z 3 ( j , j ) ,
  • V k ( T ) ( g , g ) = k g = g g g = Z 3 ( g , g ) ,
  • F T ( j , f ) = j k = Z 3 ( f , j ) ,
  • V S T ( h , h ) = T ( h k , h k ) = T ( 1 , 1 ) = 1 k = Z 3 ( h , h ) .
Therefore, it is clear that the nullnorm Z 3 defined by Formula (5) in Theorem 3 is different from the nullnorms V k ( S ) , V k ( T ) , F T and V S T given in refs. [7,9,14].
Example 9.
Consider the bounded lattice from Example 5, i.e., ( L 5 = { 0 , k , p , t , x , y , z , 1 } , , 0 , 1 ) characterized by the Hasse diagram in Figure 7.
Let us apply the construction methods in refs. [9,14] and Theorem 3, and putting x = η S = S as taken, we obtain the following:
  • F S ( x , p ) = x k = Z 3 ( x , p ) ,
  • V T S ( p , z ) = S ( p k , z k ) = S ( 0 , 0 ) = 0 k = Z 3 ( p , z ) .
Thus, it is clearly seen that the nullnorm Z 3 defined by Formula (5) in Theorem 3 is different from the nullnorms F S and V T S given in refs. [9,14].
In the following Corollary 3, by taking T = T for the nullnorm Z 3 in Theorem 3, we obtain the following nullnorm Z 3 on L having an annihilator element k without any constraints.
Corollary 3.
Let ( L , , 0 , 1 ) be a bounded lattice, k L { 0 , 1 } and η ( 0 , k ) . Then, the function Z 3 : L 2 L defined by
Z 3 ( p , q ) = p q η i f ( p , q ) ( 0 , k ) 2 , p q i f ( p , q ) [ k , 1 ] 2 , p q i f ( p , q ) { 0 } × [ 0 , k ) [ 0 , k ) × { 0 } , k o t h e r w i s e ,
is a nullnorm on L with the annihilator element k.
The structure of the nullnorm Z 3 given in Formula (6) is summarized in Figure 12.
Next, we present a construction method for nullnorms induced by the element η ( k , 1 ) , which utilizes the existence of a t-conorm on [ 0 , k ] .
Theorem 4.
Let ( L , , 0 , 1 ) be a bounded lattice, k L { 0 , 1 } , η ( k , 1 ) and S be a t-conorm on [ 0 , k ] . Then, the function Z 4 : L 2 L defined by
Z 4 ( p , q ) = S ( p , q ) i f ( p , q ) [ 0 , k ) 2 , p q η i f ( p , q ) [ k , 1 ) 2 , p q i f ( p , q ) { 1 } × [ k , 1 ] [ k , 1 ] × { 1 } , k o t h e r w i s e ,
is a nullnorm on L with the annihilator element k.
Proof. 
The proof follows easily from Theorem 3, and therefore it is omitted. □
The structure of the nullnorm Z 4 given in Formula (7) is summarized in Figure 13.
In order to show that the nullnorm Z 4 defined by Formula (7) in Theorem 4 is different from the nullnorms obtained by the construction methods in the literature, we present the following examples.
Remark 7.
(i) If we take T ( p , q ) = p q 1 { p , q } p q η o t h e r w i s e and R ( p k , q k ) = k in [17], the nullnorm V T S , R coincides with the nullnorm Z 4 obtained by Formula (7).
  • (ii) If we take T ( p , q ) = p q 1 { p , q } p q η o t h e r w i s e and F ( p k , q k ) = k in ref. [17], the nullnorm V s T , F coincides with the nullnorm Z 4 obtained by Formula (7).
Example 10.
Consider the bounded lattice from Example 4, i.e., ( L 4 = { 0 , f , g , h , i , j , k , 1 } , ) characterized by the Hasse diagram in Figure 6.
By taking the construction methods in [7,9,14] into account alongside Theorem 4 and putting j = η , T = T as taken, we obtain the following:
  • V k ( S ) ( j , j ) = k j = j j j = Z 4 ( j , j ) ,
  • V k ( T ) ( h , h ) = T ( h k , h k ) = T ( 1 , 1 ) = 1 k = Z 4 ( h , h ) ,
  • F T ( i , f ) = i ( f k ) = i i = i k = Z 4 ( i , f ) ,
  • V S T ( f , f ) = T ( f k , f k ) = T ( 1 , 1 ) = 1 k = Z 4 ( f , f ) .
Therefore, it is clear that the nullnorm Z 4 defined by Formula (7) in Theorem 4 is different from the nullnorms V k ( S ) , V k ( T ) , F T and V S T given in refs. [7,9,14].
Example 11.
Consider the bounded lattice from Example 5, i.e., ( L 5 = { 0 , k , p , t , x , y , z , 1 } , ) characterized by the Hasse diagram in Figure 7.
Let us apply the construction methods in [9,14] and Theorem 4, and putting y = η , S = S as taken, we obtain the following:
  • F S ( x , z ) = x k = Z 4 ( x , z ) ,
  • V T S ( z , z ) = S ( z k , z k ) = S ( 0 , 0 ) = 0 k = Z 4 ( z , z ) .
Thus, it is clearly seen that the nullnorm Z 4 defined by Formula (7) in Theorem 4 is different from the nullnorms F S and V T S given in refs. [9,14].
In Theorem 4, putting the t-conorm S = S , we obtain the following element-based construction method for nullnorms via the element η ( k , 1 ) of a lattice.
Corollary 4.
Let ( L , , 0 , 1 ) be a bounded lattice, k L { 0 , 1 } , η ( k , 1 ) . Then, the function Z 4 : L 2 L defined by
Z 4 ( p , q ) = p q i f ( p , q ) [ 0 , k ) 2 , p q η i f ( p , q ) [ k , 1 ) 2 , p q i f ( p , q ) { 1 } × ( k , 1 ] ( k , 1 ] × { 1 } , k o t h e r w i s e ,
is a nullnorm on L with the annihilator element k.
The structure of the nullnorm Z 4 given in Formula (8) is summarized in Figure 14.

4. Conclusions

Nullnorms on bounded lattices, particularly their representations and constructions, have been the subject of intensive study in recent years. Representation issues were deeply studied, e.g., in [16], considering elements comparable with the given annihilator. We have introduced new construction methods for such situations in Theorems 1, 3 and 4. Representations dealing with elements incomparable with the considered annihilator were studied, e.g., in [21]. The authors there have observed that the difficulty in constructing nullnorms on bounded lattices lies just in the cases where there are elements incomparable with the considered annihilator k. This problem was discussed in our Corollaries 1 and 2, which can be seen as most important results of this paper. Observe that numerous examples transparently illustrate the obtained results, stressing the difference between our approaches and those in the existing literature. We believe that the presented methods may inspire the development of new construction techniques for other types of aggregation functions.

Author Contributions

Conceptualization, Ü.E. and R.M.; methodology, Ü.E., M.Y. and R.M.; validation, Ü.E., M.Y. and R.M.; investigation, Ü.E., M.Y. and R.M.; writing—original draft preparation, M.Y.; writing—review and editing, Ü.E., M.Y. and R.M.; visualization, Ü.E. and R.M.; supervision, Ü.E. and R.M. All authors have read and agreed to the published version of the manuscript.

Funding

This study was supported by the Scientific and Technological Research Council of Turkey (TÜBİTAK) under Grant Number 122F472. The authors thank TÜBİTAK for their support. This study was supported by the Office of Scientific Research Projects of Karadeniz Technical University, Project Number: FDK-2022-10396. The third author kindly acknowledges the support of the grant VEGA 1/0036/23.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Calvo, T.; De Baets, B.; Fodor, J. The functional equations of Frank and Alsina for uninorms and nullnorm. Fuzzy Sets Syst. 2001, 120, 385–394. [Google Scholar] [CrossRef]
  2. Mas, M.; Mayor, G.; Torrens, J. t-operators. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 1999, 7, 31–50. [Google Scholar] [CrossRef]
  3. Mas, M.; Mayor, G.; Torrens, J. The distributivity condition for uninorms and t-operators. Fuzzy Sets Syst. 2002, 128, 209–225. [Google Scholar] [CrossRef]
  4. Drygaś, P. A characterization of idempotent nullnorms. Fuzzy Sets Syst. 2004, 145, 455–461. [Google Scholar] [CrossRef]
  5. Qin, F.; Zhao, B. The distributive equations for idempotent uninorms and nullnorms. Fuzzy Sets Syst. 2005, 155, 446–458. [Google Scholar] [CrossRef]
  6. Xie, A.; Liu, H. On the distributivity of uninorms over nullnorms. Fuzzy Sets Syst. 2013, 211, 62–72. [Google Scholar] [CrossRef]
  7. Karaçal, F.; İnce, M.A.; Mesiar, R. Nullnorms on bounded lattices. Inf. Sci. 2015, 325, 227–236. [Google Scholar] [CrossRef]
  8. Çaylı, G.D.; Karaçal, F. Some remarks on idempotent nullnorms on bounded lattices. In Aggregation Functions in Theory and in Practice; Springer International Publishing: Berlin/Heidelberg, Germany, 2018; pp. 31–39. [Google Scholar]
  9. Çaylı, G.D. Nullnorms on bounded lattices derived from t-norms and t-conorms. Inf. Sci. 2020, 512, 1134–1154. [Google Scholar] [CrossRef]
  10. Çaylı, G.D. Construction methods for idempotent nullnorms on bounded lattices. Appl. Math. Comput. 2020, 366, 124746. [Google Scholar] [CrossRef]
  11. Çaylı, G.D. Some results about nullnorms on bounded lattices. Fuzzy Sets Syst. 2020, 386, 105–131. [Google Scholar] [CrossRef]
  12. Çaylı, G.D. Construction of nullnorms on some special classes of bounded lattices. Int. J. Approx. Reason. 2021, 134, 111–128. [Google Scholar] [CrossRef]
  13. Dan, Y.; Hu, B.Q.; De Baets, B. Nullnorms on bounded lattices constructed by means of closure and interior operators. Fuzzy Sets Syst. 2022, 439, 142–156. [Google Scholar] [CrossRef]
  14. Ertuğrul, Ü. Construction of nullnorms on bounded lattices and an equivalence relation on nullnorms. Fuzzy Sets Syst. 2018, 334, 94–109. [Google Scholar] [CrossRef]
  15. İnce, M.A.; Karaçal, F.; Mesiar, R. Medians and nullnorms on bounded lattices. Fuzzy Sets Syst. 2016, 289, 74–81. [Google Scholar] [CrossRef]
  16. Sun, X.; Liu, H. Representation of nullnorms on bounded lattices. Inf. Sci. 2020, 539, 269–276. [Google Scholar] [CrossRef]
  17. Xie, J.; Ji, W. New constructions of nullnorms on bounded lattices. J. Appl. Math. Phys. 2021, 9, 1–10. [Google Scholar] [CrossRef]
  18. Birkhoff, G. Lattice Theory; American Mathematical Society Colloquium Publishers: Providence, RI, USA, 1967. [Google Scholar]
  19. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  20. Karaçal, F.; Şanlı, Z. Some new construction methods of t-norms and t-conorms on bounded lattices. Fuzzy Sets Syst. 2022, 451, 84–93. [Google Scholar] [CrossRef]
  21. Zhang, H.P.; Ouyang, Y.; Wang, Z.; De Baets, B. A complete representation theorem for nullnorms on bounded lattices with ample illustrations. Fuzzy Sets Syst. 2022, 439, 157–169. [Google Scholar] [CrossRef]
Figure 1. The structure of the nullnorm Z 1 .
Figure 1. The structure of the nullnorm Z 1 .
Axioms 14 00856 g001
Figure 2. Hasse diagram of L 1 .
Figure 2. Hasse diagram of L 1 .
Axioms 14 00856 g002
Figure 3. The structure of the nullnorm Z 1 .
Figure 3. The structure of the nullnorm Z 1 .
Axioms 14 00856 g003
Figure 4. Hasse diagram of L 2 .
Figure 4. Hasse diagram of L 2 .
Axioms 14 00856 g004
Figure 5. Hasse diagram of L 3 .
Figure 5. Hasse diagram of L 3 .
Axioms 14 00856 g005
Figure 6. Hasse diagram of L 4 .
Figure 6. Hasse diagram of L 4 .
Axioms 14 00856 g006
Figure 7. Hasse diagram of L 5 .
Figure 7. Hasse diagram of L 5 .
Axioms 14 00856 g007
Figure 8. The structure of the nullnorm Z 2 .
Figure 8. The structure of the nullnorm Z 2 .
Axioms 14 00856 g008
Figure 9. The structure of the nullnorm Z 2 .
Figure 9. The structure of the nullnorm Z 2 .
Axioms 14 00856 g009
Figure 10. Hasse diagram of L 6 .
Figure 10. Hasse diagram of L 6 .
Axioms 14 00856 g010
Figure 11. The structure of the nullnorm Z 3 .
Figure 11. The structure of the nullnorm Z 3 .
Axioms 14 00856 g011
Figure 12. The structure of the nullnorm Z 3 .
Figure 12. The structure of the nullnorm Z 3 .
Axioms 14 00856 g012
Figure 13. The structure of the nullnorm Z 4 .
Figure 13. The structure of the nullnorm Z 4 .
Axioms 14 00856 g013
Figure 14. The structure of the nullnorm Z 4 .
Figure 14. The structure of the nullnorm Z 4 .
Axioms 14 00856 g014
Table 1. The nullnorm Z 1 induced by Formula (1) in Theorem 1.
Table 1. The nullnorm Z 1 induced by Formula (1) in Theorem 1.
Z 1 0kptx η 1
00k00k0k
kkkkkkkk
p0k00k00
t0k00k0k
xkkkkkkx
η 0k00k00
1kk0kx01
Table 2. The nullnorm Z induced by Formula (1) in Theorem 1.
Table 2. The nullnorm Z induced by Formula (1) in Theorem 1.
Z0gklt η 1
00gkkggk
gggkkggk
kkkkkkkk
lkkklkkl
tggkkggk
η ggkkggk
1kkklkk1
Table 3. The nullnorm Z 2 induced by Formula (3) in Theorem 2.
Table 3. The nullnorm Z 2 induced by Formula (3) in Theorem 2.
Z 2 0kmpqt η 1
00kmkkkkk
kkkkkkkkk
mmkkkkkkk
pkkkttttt
qkkkttttt
tkkkttttt
η kkkttttt
1kkktttt1
Table 4. The nullnorm Z induced by Formula (3) in Theorem 2.
Table 4. The nullnorm Z induced by Formula (3) in Theorem 2.
Z0kpry η 1
00kpkkkk
kkkkkkkk
ppkkkkkk
rkkkrrrr
ykkkrrrr
η kkkrrrr
1kkkrrr1
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ertuğrul, Ü.; Yeşilyurt, M.; Mesiar, R. Element-Oriented Construction Methods for Nullnorms on Bounded Lattices. Axioms 2025, 14, 856. https://doi.org/10.3390/axioms14120856

AMA Style

Ertuğrul Ü, Yeşilyurt M, Mesiar R. Element-Oriented Construction Methods for Nullnorms on Bounded Lattices. Axioms. 2025; 14(12):856. https://doi.org/10.3390/axioms14120856

Chicago/Turabian Style

Ertuğrul, Ümit, Merve Yeşilyurt, and Radko Mesiar. 2025. "Element-Oriented Construction Methods for Nullnorms on Bounded Lattices" Axioms 14, no. 12: 856. https://doi.org/10.3390/axioms14120856

APA Style

Ertuğrul, Ü., Yeşilyurt, M., & Mesiar, R. (2025). Element-Oriented Construction Methods for Nullnorms on Bounded Lattices. Axioms, 14(12), 856. https://doi.org/10.3390/axioms14120856

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop