Next Article in Journal
Stability and Controllability of Nonlinear Dynamic Systems with Neural Networks: An Application to Financial Data
Previous Article in Journal
The Fourier Regularization for Solving a Cauchy Problem for the Laplace Equation with Uncertainty
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Systematic Study on Distributivity of Threshold-Generated Implications over Uninorms

by
Zhihong Yi
School of Mathematics & Information Science, Nanchang Normal University, Nanchang 330032, China
Axioms 2025, 14(11), 807; https://doi.org/10.3390/axioms14110807 (registering DOI)
Submission received: 13 September 2025 / Revised: 25 October 2025 / Accepted: 27 October 2025 / Published: 30 October 2025
(This article belongs to the Topic Fuzzy Sets Theory and Its Applications)

Abstract

The distributivity of implications over fuzzy operators is a desirable property for fuzzy systems and can be employed in the elimination of the explosion of if–then rules. In this paper, we try to explore the relationship between the distributivity over the uninorms-related fuzzy connectives and the distributivity over uninorms in the threshold generation method, i.e., the distributive equations I ( u , U 1 ( v , w ) ) = U 2 ( I ( u , v ) , I ( u , w ) ) and I ( U 1 ( u , v ) , w ) ) = U 2 ( I ( u , w ) , I ( v , w ) ) with I being the threshold-generated implication. Consequently, we find that if the uninorms are restricted to special classes, then the distributivity property by the first equation can be preserved between the original and threshold-generated implications; under certain constraints on the threshold-generated implication, the distributivity property by the second equation becomes trivial.

1. Introduction

Given the inherent incompleteness and uncertainty in our understanding of complex systems, one viable approach is to utilize expert knowledge expressed through natural language constructs, particularly if–then statements. Therefore, fuzzy implications [1,2], with which if–then statements can be well formalized, are essential for the operation of intelligent systems, approximate reasoning, and decision analysis.

1.1. Generated Fuzzy Implications

It is crucial to offer a broad range of fuzzy implications, as their adequacy depends on the specific conditional rule behavior they must model and the inference rules to be employed. These implications are commonly derived from fuzzy connectives like t-(co)norms and negations, with the R-, (S, N)-, QL-, and D-implications representing the well-established classes. Further, fuzzy implications could also be constructed using other binary operators, such as copulas, quasi-copulas, more general conjunctors [3], representable aggregation functions [4], uninorms [5,6,7,8], and overlap functions [9,10]. Based on generating functions, Yager [11] has introduced the f-,g-generated implications, which were extensively explored in [12,13,14,15,16]. Since then, various generation methods are proposed along the lines of Yager’s implications. Massanet and Torrens [17] introduced h-implications, which are found to have the validity of some axioms derived from classical fuzzy logic tautologies, especially those related fuzzy implications. Liu introduced (g,min)-implications [18] and (h,min)-implications [19], using g-generators and generalized h-generators, respectively. In another paper [20], leveraging the generalized additive generator h of a representable uninorm, she introduced the so-called h 1 -implications. A series of necessary and sufficient conditions, under which the three classes of implications satisfy several classical tautologies, is derived. Meanwhile, by an f-generator and an increasing function g : [ 0 , 1 ] [ 0 , 1 ] satisfying g ( 0 ) = 0 and g ( 1 ) = 1 , Xie and Liu [21] introduced ( f , g ) -implication which is extension of f-generated implication by Yager. With a g-generator and a u-operator of g, Zhang and Liu [22] developed the ( g , u ) -implications. With the interpretation of ¬ ( A ¬ B ) and using two fuzzy negations (f and g) and a uninorm U, Hliněná et al. [23] generalized f-generated implication and developed fuzzy implications I U , f , g .
Beyond the standard classes, new fuzzy implications can be generated from existing ones using various methods, including the conjugation, the min (or max) operation, the convex combination, and the composition of fuzzy implication(s).
Massanet and Torrens introduced two related construction techniques: the threshold generation method (in [24]), which uses an adequate transformation on the second variable of two original fuzzy implications, and the vertical threshold generation method (in [25]), which applies an adequate transformation on the first variable. Su et al. [26] proposed the ordinal sum of implications which is much similar to the ordinal sum of t-(co)norms [27]. In the very recent, Cheng et al. [28] constructed implications by vertical ordinal sum method and deformed vertical ordinal sum method.

1.2. Distributivity of Fuzzy Implications over Fuzzy Connectives

To handle the rule explosion in fuzzy reasoning, Combs and Andrews [29] took advantage of the axiom ( m n ) r = ( m r ) ( n r ) and asserted that the two-rule configurations, i.e., IRC and URC, are equivalent in fuzzy inference, which sparked intense discussion regarding the necessity for theoretical investigation before such equations could be properly employed. Subsequently, in the standard fuzzy sets theory, Trillas & Alsina [30] explored the fuzzy version of the above axiom:
I ( T ( u , v ) , w ) = S ( I ( u , w ) , I ( v , w ) ) ,
with t-norm T, t-conorm S, and fuzzy implication I, in addition to all solutions of T and S, given that I is a residual implication, an S-implication, and a Q L -implication, respectively. Then, Balasubramaniam and Rao [31] explored the following three distributive equations closely related to Equation (1).
I ( S ( u , v ) , w ) = T ( I ( u , w ) , I ( v , w ) )
I ( u , T 1 ( v , w ) ) = T 2 ( I ( u , v ) , I ( u , w ) )
I ( u , S 1 ( v , w ) ) = S 2 ( I ( u , v ) , I ( u , w ) )
with t-norms T and T i   ( i = 1 , 2 ) , t-conorms S and S i   ( i = 1 , 2 ) and a fuzzy implication I. Actually, in the much earlier time, Turksen et al. proposed some new classes of implications with some new axioms, including Equation (3) and obtained necessary conditions for a fuzzy implication I to satisfy
I ( u , T ( v , w ) ) = T ( I ( u , v ) , I ( u , w ) )
with T is the product t-norm. Further, Baczyński focused on strict t-norm T and presented the sufficient and necessary conditions of a system of equations including Equation (5) and I ( u , I ( v , w ) ) = I ( T ( u , v ) , w ) . Subsequently, a full characterization of Equation (5) and I ( u , v ) = I ( N ( v ) , N ( u ) ) was obtained step by step, which can be found in [32,33]. And then there is a flourish of investigations about the distributivity properties of fuzzy implications with respect to fuzzy operators, including the t-(co)norms [33,34,35,36,37,38,39,40], the uninorms [41,42]. Additionally, Baczyński tried to connect these works with the connectives in interval-valued fuzzy sets theory [34,43].

1.3. Main Motivations of the Work

Since uninorms are natural generalizations of t-(co)norm, the distributivity equations with respect to uninorms are also the focus of the research. Ruiz-Aguilera and Torrens [44,45,46] explored the aforementioned equation with uninorms. That is
I ( U 1 ( u , v ) , w ) ) = U 2 ( I ( u , w ) , I ( v , w ) )
I ( u , U 1 ( v , w ) ) = U 2 ( I ( u , v ) , I ( u , w ) ) ,
in which U i is a uninorm ( i = 1 , 2 ) and I is the strong implication and the residual implication, respectively. In [41], Baczyński presented a characterization for Equations (6) and (7) when U i is a given representable uninorm ( i = 1 , 2 ) and I is an operator like a fuzzy implication. Intrigued by those above, we consider the distributivity of the threshold-generated implications over uninorms.
As shown in [24,47], under some minimal necessary conditions, the threshold-generated implications preserve most established properties, particularly the distributivity properties over the t-norms and the t-conorms. Along the lines of thought, we intend to check the distributivity over uninorms when the involved implications are the threshold-generated implications. Specifically, we try to explore the relationship between the distributivity over the uninorm-related fuzzy connectives and the distributivity over uninorms with Equations (6) and (7). We refer to the four classes of uninorms, i.e., the uninorms in U min or U max , the representable uninorms, the idempotent uninorms, and the uninorms continuous in ] 0 , 1 [ × ] 0 , 1 [ . Consequently, we find that if the uninorms are restricted to special classes, then the distributivity property by Equation (7) can be preserved between the original and threshold-generated implications; under certain constraints on the threshold-generated implication, the distributivity property by Equation (6) becomes trivial. However, with the byproducts, some results related to h-implication are obtained.

1.4. Outline of the Work

In Section 2, some notations on the threshold-generated fuzzy implications and the structures of the uninorms are reviewed. In Section 3, we concentrate on Equation (7) and demonstrate the relationships between threshold generated implication and the original implications about the preservation on distributivity in three cases. Section 4 deals with Equation (6). At the end, some concluding remarks are presented.

2. Preliminary

For convenience, we list some notations that are used in the paper in Table 1.
T-norms and t-conorms are basic operators in information aggregating [48,49,50,51,52,53,54] in various applications. For the details about these operators, we recommend the monographs [2,27,55]. We only recall some of the notations and results that are used.
Definition 1
([1,2]). A function I : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] is a fuzzy implication (or implication), if the following holds:
I ( u , w ) I ( v , w ) for u v
I ( u , v ) I ( u , w ) for v w
I ( 0 , 0 ) = 1 ,
I ( 1 , 1 ) = 1 ,
I ( 1 , 0 ) = 0 .
By Equations (8)–(12), we have I ( 0 , 0 ) = I ( 0 , 1 ) = I ( 1 , 1 ) = 1 . Therefore, a fuzzy implication is a natural extension of the classical one. We only recall the f-,g- and h-implications here.
Definition 2
([11,17]).
(i) 
Let f : [ 0 , 1 ] [ 0 , + ] be a strictly decreasing and continuous operator satisfying f ( 1 ) = 0 , then I f : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] given by I f ( u , v ) = f 1 ( u f ( v ) ) , with the interpretation 0 · + = 0 is said to be an f-implication and f is an f-generator.
(ii) 
Let g : [ 0 , 1 ] [ 0 , + ] be a strictly increasing and continuous function such that g ( 0 ) = 0 , then I g : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] given by I g ( u , v ) = g 1 ( 1 u g ( v ) ) , with the interpretation 1 0 = + , + · 0 = 0 , is said to be a g-implication and g is said to be a g-generator.
(iii) 
Fix an e ( 0 , 1 ) and Let h : [ 0 , 1 ] [ , + ] be a strictly increasing and continuous function such that h ( 0 ) = , h ( e ) = 0 and h ( 1 ) = + , then I h : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] given by I h ( u , v ) = 1 , u = 0 ; h 1 ( u h ( v ) ) , u > 0 , v e ; h 1 ( 1 u h ( v ) ) , u > 0 , v > e ; is said to be an h-implication and h is said to be an h-generator.
In fact, the f-generator, the g-generator, and the h-generator are the additive generators of some continuous Archimedean t-norms, some continuous Archimedean t-conorms, and some representable uninorms, respectively. For convenience, we list some of the most referred to implications in Table 2, some of which will be used in the rest of the paper.
It is vital to provide plenty of suitable implications for various applications so that many methods to generate an implication from the given ones are proposed. Here, we only recall the threshold generation method.
Theorem 1
([24,47]). (Threshold generation method) Let I 1 , I 2 be implications with e 0 , 1 . The binary operator I I 1 I 2 : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] by
I I 1 I 2 ( u , v ) = 1 , u = 0 ; e I 1 ( u , v e ) u > 0 and 0 v e ; e + ( 1 e ) I 2 ( u , v e 1 e ) , u > 0 and v > e
is a fuzzy implication, which is said to be the e-threshold-generated implication from I 1 and I 2 ,
The properties of the threshold-generated implications can be found in [24,47]. In the last equation, e ] 0 , 1 [ is used; the method can be considered to be a single-valued threshold generation. The multi-valued version of the method can be found in [56].
Theorem 2
([56,57]). Let n N and { I k } 0 k n be a set of implications, E = { e i i = 1 , 2 , n , n N } with 0 < e 1 < e 2 < < e n < e n + 1 = 1 ; then, the binary operator I E : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] by
I E ( u , v ) = 1 , u = 0 ; e 1 I 0 ( u , v e 1 ) u > 0 , 0 v e 1 ; e k + ( e k + 1 e k ) I k ( u , v e k e k + 1 e k ) , u > 0 , e k < v e k + 1 f o r k 1 ,
is a fuzzy implication, which is said to be the E-generated implication.
Since the set E is finite, the extended threshold generation method can also be considered to be an iterative process of the single-valued threshold generation method. In what follows, we will also use the two-valued threshold-generated implications. For convenience, we denote the implications generated by single-valued (e) and the multi-valued threshold-generated implications by I I 1 I 2 and I E , respectively.
In the following, we will use the neutrality property (NP) of implication. Namely, for u 0 , 1
I ( 1 , u ) = u ,
where I is an implication.
As a well-established aggregating function, uninorm is a commutative, increasing, associative binary operator U in the unit square with the neutral element e u lying in [ 0 , 1 ] and can be employed in various fields. A uninorm U is conjunctive (disjunctive) if U ( 1 , 0 ) = 0 (1) and it has a combinational structure of a t-norm and a t-conorm [58]. Here, we list the structural results on some commonly used uninorms.
Theorem 3
([59]). A binary operator U : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] is a conjunctive (or disjunctive) uninorm with neutral element e u ] 0 , 1 ] with U ( · , 1 ) being continuous on [ 0 , e u [ if and only if there is a t-norm T and a t-conorm S such that
U ( u , v ) = e u T ( u e u , v e u ) , ( u , v ) [ 0 , e u ] 2 ; e u + ( 1 e u ) S ( u e u 1 e u , v e u 1 e u ) ( u , v ) [ e u , 1 ] 2 ; min ( u , v ) ( o r max ( u , v ) ) , e l s e
The class of conjunctive and disjunctive uninorms are denoted by U min and U max , respectively.
Theorem 4
([58]). Let U be a uninorm whose neutral element is e u ] 0 , 1 [ . There is a strictly increasing continuous function h : [ 0 , 1 ] [ , + ] satisfying h ( 0 ) = , h ( e u ) = 0 , and h ( 1 ) = + such that
U ( u , v ) = h 1 ( h ( u ) + h ( v ) )
for ( u , v ) [ 0 , 1 ] × [ 0 , 1 ] { ( 0 , 1 ) , ( 1 , 0 ) } if and only if
(i) U is strictly increasing and continuous on ] 0 , 1 [ × ] 0 , 1 [ ;
(ii) there is an involutive negation N with the fixed point being e u , such that
U ( u , v ) = N ( U ( N ( u ) , N ( v ) ) ) ,
for ( u , v ) [ 0 , 1 ] × [ 0 , 1 ] { ( 0 , 1 ) , ( 1 , 0 ) }
The uninorms in the above theorem are said to be representable and h is an additive generator. Denote the set of the representable uninorms by U R .
Theorem 5
([60]). Let U be a uninorm continuous in ] 0 , 1 [ × ] 0 , 1 [ with the neutral element e u ] 0 , 1 [ . Then one of the following holds:
(i) 
There are β [ 0 , e u [ and α [ 0 , β ] , two continuous t-norms T 1 and T 2 , and a representable uninorm R such that the uninorm U can be characterized by
U ( u , v ) = α T 1 ( u α , v α ) , ( u , v ) ] 0 , α [ 2 ; α + ( β α ) T 2 ( u α β α , v α β α ) , ( u , v ) ] α , β [ 2 ; β + ( 1 β ) R ( u β 1 β , v β 1 β ) , ( u , v ) ] β , 1 [ 2 ; 1 , min ( u , v ) ] α , 1 ] a n d max ( u , v ) = 1 ; α o r 1 , ( u , v ) { ( α , 1 ) , ( 1 , α ) } ; min ( u , v ) , e l s e .
(ii) 
There are γ ] e u , 1 ] and δ [ γ , 1 ] , two continuous t-conorms S 1 and S 2 , and a representable uninorm R such that U can be characterized by
U ( u , v ) = γ R ( u γ , v γ ) , ( u , v ) ] 0 , γ [ 2 ; γ + ( δ γ ) S 1 ( u γ δ γ , v γ δ γ ) , ( u , v ) ] γ , δ [ 2 ; δ + ( 1 δ ) S 2 ( u δ 1 δ , v δ 1 δ ) , ( u , v ) ] δ , 1 [ 2 ; 0 , max ( u , v ) [ 0 , δ [ a n d min ( u , v ) = 0 ; δ o r 0 , ( u , v ) { ( 0 , δ ) , ( δ , 0 ) } ; max ( u , v ) , e l s e .
Denote the set of these uninorms by U c o s and in particular the set of these uninorms with Equations (18) and (19), which are denoted by U c o s , m i n and U c o s , m a x , respectively. Specifically, a uninorm U in U c o s , m i n (or U c o s , m a x ) will be represented by U = T 1 , α , T 2 , β , ( R , e u ) c o s , m i n (or U = ( R , e u ) , γ , S 1 , δ , S 2 c o s , m a x ). It must be mentioned that U R U c o s since the uninorm U reduces to the representable uninorm if β = 0 in Equation (18) or δ = 1 in Equation (19).
Idempotency is one of the most referred properties of fuzzy operators in the literature. De Baets firstly provided a full characterization of the left-continuous idempotent uninorms and the right-continuous idempotent uninorms in [59]. Then Martin et al. characterized the idempotent uninorms in [61].
Theorem 6
([61]). U is an idempotent uninorm whose neutral element is e u [ 0 , 1 ] if and only if there is a decreasing function g : [ 0 , 1 ] [ 0 , 1 ] satisfying g ( u ) = 1 for u < g ( 1 ) , g ( e u ) = e u ,   a n d g ( u ) = 0 for u > g ( 0 ) , such that inf { v g ( v ) = g ( u ) } g ( g ( u ) ) sup { v g ( v ) = g ( u ) } for u [ 0 , 1 ] and
U ( u , v ) = min ( u , v ) , v < g ( u ) , o r v = g ( u ) a n d u < g ( g ( u ) ) ; max ( u , v ) , v > g ( u ) , o r v = g ( u ) a n d u > g ( g ( u ) ) ; min ( u , v ) o r max ( u , v ) , v = g ( u ) a n d u = g ( g ( u ) ) .
Denote the set of the idempotent uninorms by U I .

3. On the Distributive Equation I ( u , U 1 ( v , w ) ) = U 2 ( I ( u , v ) , I ( u , w ) )

Proposition 1.
Let U 1 , U 2 be uninorms and I 1 , I 2 be two fuzzy implications satisfying (NP), i.e., I i ( 1 , v ) = v for v [ 0 , 1 ] , ( i = 1 , 2 ) . If the triple ( I I 1 I 2 , U 1 , U 2 ) satisfies Equation (7), then U 1 = U 2 .
Proof. 
According to Equation (13) and the neutral property of I 1 and I 2 , we have for v [ 0 , 1 ] , I I 1 I 2 ( 1 , v ) = v . That is, I I 1 I 2 satisfies (NP). Consequently, let u = 1 and I = I I 1 I 2 in Equation (7); we have I I 1 I 2 ( 1 , U 1 ( v , w ) ) = U 2 ( I I 1 I 2 ( 1 , v ) , I I 1 I 2 ( 1 , w ) ) , which implies U 1 ( v , w ) = U 2 ( v , w ) through the neutral property of I I 1 I 2 .□
Under the referred requirements, the two uninorms in Equation (7) are the same. Moreover, with the preservation of the neutral property [47] in the threshold generation method, we can easily get the neutral property of the threshold-generated implication if the neutral property of all original implications holds. Therefore, it is enough to consider
I ( u , U ( v , w ) ) = U ( I ( u , v ) , I ( u , w ) )
in which U is a uninorm with the neutral element being e u while I is a threshold-generated implication with the neutral property.
Proposition 2.
Assume I 1 and I 2 are fuzzy implications and I I 1 I 2 satisfies Equation (20). For each i { 1 , 2 } , either I i is continuous except maybe at ( 0 , 0 ) , or there is u 0 ] 0 , 1 [ such that I i ( u 0 , v ) v for v ] 0 , 1 [ , then U ( e , e ) = 0 or U ( e , e ) = 1 or U ( e , e ) = e .
Proof. 
Let u > 0 , v = w = e in Equation (20), then I I 1 I 2 ( u , U ( e , e ) ) = U ( I I 1 I 2 ( u , e ) , I I 1 I 2   ( u , e ) ) = U ( e , e ) .
(i)
For U ( e , e ) e , it follows that e I 1 ( u , U ( e , e ) e ) = U ( e , e ) , i.e., I 1 ( u , U ( e , e ) e ) = U ( e , e ) e .
(a)
If I 1 is continuous except maybe at ( 0 , 0 ) and U ( e , e ) > 0 ; then, there is v 0 = U ( e , e ) e such that I 1 ( u , v 0 ) = v 0 for u > 0 . Since I 1 is continuous at ( 0 , v 0 ) and I 1 ( 0 , v 0 ) = 1 , then v 0 = lim u 0 + I 1 ( u , v 0 ) = I 1 ( 0 , v 0 ) = 1 , and consequently U ( e , e ) = e .
(b)
If there is u 0 ] 0 , 1 [ such that I 1 ( u 0 , v ) v for v ] 0 , 1 [ , then v 0 = 0 or v 0 = 1 with the fact that I 1 ( u 0 , v 0 ) = v 0 and v 0 = U ( e , e ) e > 0 . Thus U ( e , e ) = e or U ( e , e ) = 0 .
(ii)
For U ( e , e ) > e , it follows that e + ( 1 e ) I 2 ( u , U ( e , e ) e 1 e ) = U ( e , e ) , i.e., I 2 ( u , U ( e , e ) e 1 e ) = U ( e , e ) e 1 e , where U ( e , e ) e 1 e is denoted by v 0 and v 0 > 0 .
(a)
If I 2 is continuous except maybe at ( 0 , 0 ) , and here there is v 0 > 0 such that I 2 ( u , v 0 ) = v 0 for u > 0 ; then, we have v 0 = 1 with the fact that I 2 ( 0 , v 0 ) = 1 and I 2 is continuous at the point ( 0 , v 0 ) .
(b)
If there is u 0 ] 0 , 1 [ such that I 2 ( u 0 , v ) v for v ] 0 , 1 [ and here we have I 2 ( u 0 , v 0 ) = v 0 , then v 0 = 0 or v 0 = 1 ; consequently, U ( e , e ) = e or U ( e , e ) = 1 .
We provide some examples on solutions for Equation (20) for the uninorm U with U ( e , e ) = 0 and U ( e , e ) = 1 , respectively.
Example 1.
(i) 
Let e u = 2 3 , e = 1 3 and the weak negation N ( u ) = 1 , u = 0 1 2 , 0 < u 1 2 ; 0 e l s e ; , and the t-norm T ( u , v ) = 0 , u N ( v ) ; min ( u , v ) else ; and the uninorm U ( u , v ) = 2 3 T ( 3 u 2 , 3 v 2 ) , ( u , v ) [ 0 , 2 3 ] 2 ; max ( u , v ) , else . . Assume I h be the h-implication with h = ln u 1 u , then it can be checked that ( I I Y G I h , U ) satisfies Equation (20) with U ( 1 3 , 1 3 ) = 0 .
(ii) 
Let e u = 1 3 , e = 2 3 and the function f ( u ) = 1 , 0 u < 1 2 1 2 , 1 2 u < 1 ; 0 , u = 1 ; and the t-conorm S ( u , v ) = 1 , u f ( v ) ; max ( u , v ) , else ; and the uninorm
U ( u , v ) = 1 3 + 2 3 S ( 3 u 1 2 , 3 v 1 2 ) , ( u , v ) [ 1 3 , 1 ] 2 ; min ( u , v ) , else .
in which U ( e , e ) = 1 . Assume I h be the h-implication with h = ln u 1 u ; then, it can be checked directly that ( I I h I Y G , U ) satisfies Equation (20) with U ( 2 3 , 2 3 ) = 1 .
In the sequel, we restrict the discussion to the case U ( e , e ) = e , where e is the value in the threshold generation method. In order to show the relationships between the threshold generation implication I I 1 I 2 and the original implications I 1 and I 2 on the distributivity, we consider three cases, i.e., e u = e , e u < e , and e u > e .

3.1. The Case U ( e , e ) = e with e = e u

Here, we consider Equation (20) using different classes of uninorms, viz, the uninorm U U min or U max , the uninorm U U c o s including the representable uninorm, and the idempotent uninorm U. It can be obtained that the threshold generation method preserves the distributivity about Equation (20) for U U min or U max while the preservation of distributivity does not hold for the others.

3.1.1. The Uninorms U U min or U max

Here, we consider the case that the uninorms U U min or U max . For the case that U ( e , e ) = e = e u , then T ( u , v ) = U ( e u , e v ) e is a t-norm, and S ( u , v ) = U ( e + ( 1 e ) u , e + ( 1 e ) v ) e 1 e is a t-conorm. The following result completely characterizes the solutions of Equation (20) with the uninorm U U min or U max and it guarantees the preservation of the distributivity property from the original implications to the threshold-generated implication.
Proposition 3.
Let I 1 , I 2 be two fuzzy implications, the uninorm U U min or U max with the neutral element e u = e , then the couple ( I I 1 I 2 , U ) satisfies Equation (20) if and only if the couple ( I 1 , T ) satisfies Equation (5) and
I 2 ( u , S ( v , w ) ) = S ( I 2 ( u , v ) , I 2 ( u , w ) )
for v , w > 0 .
Proof. 
(⇐) If u = 0 , then I I 1 I 2 ( 0 , U ( v , w ) ) = 1 = U ( 1 , 1 ) = U ( I I 1 I 2 ( 0 , v ) , I I 1 I 2 ( 0 , w ) ) . If u > 0 , then we consider, respectively, the cases as follows.
(i)
For v , w e , it holds that
I I 1 I 2 ( u , U ( v , w ) ) = e I 1 ( u , U ( v , w ) e ) = e I 1 ( u , T ( v e , w e ) )
= e T ( I 1 ( u , v e ) , I 1 ( u , w e ) ) = e T ( I I 1 I 2 ( u , v ) e , I I 1 I 2 ( u , w ) e ) = U ( I I 1 I 2 ( u , v ) , I I 1 I 2 ( u , w ) ) .
(ii)
For v , w > e , it holds that U ( v , w ) > e and
I I 1 I 2 ( u , U ( v , w ) ) = e + ( 1 e ) I 2 ( u , U ( v , w ) e 1 e ) = e + ( 1 e ) I 2 ( u , S ( v e 1 e , w e 1 e ) )
= e + ( 1 e ) S ( I 2 ( u , v e 1 e ) , I 2 ( u , w e 1 e ) ) = e + ( 1 e ) S ( I I 1 I 2 ( u , v ) e 1 e , I I 1 I 2 ( u , w ) e 1 e )
= U ( I I 1 I 2 ( u , v ) , I I 1 I 2 ( u , w ) ) .
(iii)
For v e , w > e , since I I 1 I 2 is increasing with respect to the second variable, then there are two subcases to be considered: if U U min , then it holds that
I I 1 I 2 ( u , U ( v , w ) ) = I I 1 I 2 ( u , min ( v , w ) ) = I I 1 I 2 ( u , v )
= min ( I I 1 I 2 ( u , v ) , I I 1 I 2 ( u , w ) ) = U ( I I 1 I 2 ( u , v ) , I I 1 I 2 ( u , w ) ) ;
and if U U max , then it holds that
I I 1 I 2 ( u , U ( v , w ) ) = I I 1 I 2 ( u , max ( v , w ) )
= I I 1 I 2 ( u , v ) = max ( I I 1 I 2 ( u , v ) , I I 1 I 2 ( u , w ) ) = U ( I I 1 I 2 ( u , v ) , I I 1 I 2 ( u , w ) ) .
(iv)
For the case that v > e , w e , the equation can be checked similarly as (iii).
To sum up, the couple ( I I 1 I 2 , U ) satisfies Equation (20).
(⇒) Let u > 0 , v , w [ 0 , 1 ] , then I I 1 I 2 ( u , U ( e v , e w ) ) = U ( I I 1 I 2 ( u , e v ) , I I 1 I 2 ( u , e w ) ) . By Equations (1) and (3), it holds that
e I 1 ( u , T ( v , w ) ) = I I 1 I 2 ( u , e T ( v , w ) ) = U ( e I 1 ( u , v ) , e I 1 ( u , w ) ) = e T ( I 1 ( u , v ) , I 1 ( u , w ) ) .
Namely, I 1 ( u , T ( v , w ) ) = T ( I 1 ( u , v ) , I 1 ( u , w ) ) . If u = 0 , v , w [ 0 , 1 ] , I 1 ( 0 , T ( v , w ) ) = 1 = T ( 1 , 1 ) = T ( I 1 ( 0 , v ) , I 1 ( 0 , w ) ) . Thus ( I 1 , T ) satisfies Equation (5).
Now we turn to the check of Equation (21). For u , v , w > 0 , it holds that
I I 1 I 2 ( u , U ( e + ( 1 e ) v , e + ( 1 e ) w ) ) = U ( I I 1 I 2 ( u , e + ( 1 e ) v ) , I I 1 I 2 ( u , e + ( 1 e ) w ) ) ,
where e + ( 1 e ) v > e , e + ( 1 e ) w > e . By Equations (1) and (3), we have
e + ( 1 e ) I 2 ( u , S ( v , w ) ) = I I 1 I 2 ( u , e + ( 1 e ) S ( v , w ) )
= U ( e + ( 1 e ) I 2 ( u , v ) , e + ( 1 e ) I 2 ( u , w ) ) = e + ( 1 e ) S ( I 2 ( u , v ) , I 2 ( u , w ) ) .
Consequently, I 2 ( u , S ( v , w ) ) = S ( I 2 ( u , v ) , I 2 ( u , w ) ) for u , v , w > 0 . If u = 0 , v , w > 0 , then I 2 ( 0 , S ( v , w ) ) = 1 = S ( 1 , 1 ) = S ( I 2 ( 0 , v ) , I 2 ( 0 , w ) ) . Therefore, Equation (21) holds for v , w > 0 .□
The next result provides some solutions to Equation (20) with the implication I being an h-implication.
Proposition 4.
Assume the function h is an h-generator, and U = T M , or U = S M , or U are one of the following uninorms:
U 1 ( u , v ) = h 1 ( h ( u ) + h ( v ) ) , ( u , v ) [ 0 , e ] 2 ; max ( u , v ) , e l s e
U 2 ( u , v ) = h 1 ( h ( u ) + h ( v ) ) , ( u , v ) [ e , 1 ] 2 ; min ( u , v ) , e l s e
U 3 ( u , v ) = h 1 ( h ( u ) + h ( v ) ) , ( u , v ) [ 0 , e ] 2 [ e , 1 ] 2 ; max ( u , v ) , e l s e
U 4 ( u , v ) = h 1 ( h ( u ) + h ( v ) ) , ( u , v ) [ 0 , e ] 2 [ e , 1 ] 2 ; min ( u , v ) , e l s e
then ( I h , U ) satisfies Equation (20).
Proof. 
Trivially, due to the increasingness with respect to the second variable of I h , ( I h , U ) satisfies Equation (20) with U = T M or U = S M . Since U 1 is a t-conorm and U 2 is a t-norm, Propositions 26 and 32 in [47] ( I h , U 1 ) and ( I h , U 2 ) , respectively, satisfy Equation (20).
For the other cases, U 3 U max and U 4 U min . Through Remark 3 in [24], I h = I I f I g and the generators for the underlying f- and the g-implications which generated the I h can be given by f ( u ) = h ( e u ) and g ( u ) = h ( e + ( 1 e ) u ) , respectively. Let T ( u , v ) = f 1 ( f ( u ) + f ( v ) ) , then T is a t-norm with its additive generator f, and for ( u , v ) [ 0 , e ] 2   U ( u , v ) = e T ( u e , v e ) = h 1 ( h ( u ) + h ( v ) ) . It can be checked that
I f ( u , T ( v , w ) ) = T ( I f ( u , v ) , I f ( u , w ) ) = f 1 ( u f ( v ) + w f ( w ) ) ,
i.e., ( I f , T ) satisfies Equation (20). Let S ( u , v ) = g 1 ( g ( u ) + g ( v ) ) , then S is a t-conorm with additive generator g, and for ( u , v ) [ e , 1 ] 2   U ( u , v ) = e + ( 1 e ) S ( u e 1 e , v e 1 e ) = h 1 ( h ( u ) + h ( v ) ) . Thus, we have
I g ( u , S ( v , w ) ) = S ( I g ( u , v ) , I g ( u , w ) ) = g 1 ( g ( v ) + g ( w ) u ) ,
i.e., ( I g , S ) satisfies Equation (20). In particular, ( I g , S ) satisfies Equation (21) for v , w > 0 .
To sum up, ( I h , U ) satisfies Equation (20) by Proposition 3. □

3.1.2. The Other Classes of Uninorms

For the rest of uninorms, the preservation of the distributivity may not hold. Here, we show the results with several examples or propositions.
Generally, the threshold-generated implications do not satisfy Equation (20) with the uninorm U U c o s continuous in ] 0 , 1 [ × ] 0 , 1 [ , even if the associated t-norms or t-conorms satisfy the distributivity equations.
Example 2.
Assume U = T P , 1 4 , T L K , 1 2 , ( R , 3 4 ) c o s , m i n , where R is a representable uninorm with additive generator h = ln u 1 u . Let E = { 1 4 , 1 2 , 3 4 } , I 0 = I Y G , I 1 ( u , v ) = 1 , u = 0 v , e l s e ; , I 2 and I 3 be given by Equation (26) and Equation (27), respectively. The E-generated implication I E be generated by the implications I 0 , I 1 , I 2 and I 3 . Actually, I 0 , I 1 , I 2 satisfy Equation (3) with respect to T P , T L K , T , respectively, and I 3 satisfies Equation (4) with respect to S, in which T and S are the underlyig t-norm and t-conorm of R. However, it holds that I E ( 0.1 , U ( 0.6 , 0.8 ) ) 0.73 and U ( I E ( 0.1 , 0.6 ) , I E ( 0.1 , 0.8 ) ) 0.93 , which illustrates the couple ( I E , U ) does not satisfy Equation (20). This result is mainly originated in the special structureof the underlying representable uninorm R in the left-upper part and right-lower part of the unit square, where the uninorm is not defined by the commonly used min or max .
Specially, the threshold-generated implications may not satisfy Equation (20) with a representable uninorm U even if the pertaining t-norm and t-conorm satisfy the distributivity equations.
Example 3.
Let the uninorm U with the additive generator being h = ln u 1 u and the 1 2 -generated implication I I 1 I 2 be generated by the implications I 1 , I 2 , where
I 1 ( u , v ) = 1 , u = v = 0 ; f 1 ( u e f ( v ) ) , e l s e
and
I 2 ( u , v ) = 1 , u = v = 0 ; g 1 ( e u g ( v ) ) , e l s e
with f ( u ) = h ( e u ) and g ( u ) = h ( e + ( 1 e ) u ) , then ( I 1 , T ) satisfies Equation (3) and ( I 2 , S ) satisfies Equation (4) with T and S generated by f and g, respectively. However the couple ( I I 1 I 2 , U ) does not satisfy Equation (20), since I I 1 I 2 ( 0.1 , U ( 0.1 , 0.6 ) ) 0.41 and U ( I I 1 I 2 ( 0.1 , 0.1 ) , I I 1 I 2 ( 0.1 , 0.6 ) ) 0.83 .
Now we turn to the h-implications and the representable uninorms.
Proposition 5.
Let h be an h-generator with h ( e ) = 0 and U be a representable uninorm given by
U ( u , v ) = 1 o r 0 , ( u , v ) = ( 0 , 1 ) or ( 1 , 0 ) ; h 1 ( h ( u ) + h ( v ) ) , e l s e
then ( I h , U ) does not satisfy Equation (20).
Proof. 
Since I h ( u , v ) = 1 , u = 0 ; h 1 ( u h ( v ) ) , u > 0 , v e h 1 ( 1 u h ( v ) ) , u > 0 , v > e , then for u > 0 , the vertical sections I h ( u , · ) have the form
I h ( u , v ) = 0 , v = 0 ; h 1 ( u h ( v ) ) , 0 < v e ; h 1 ( 1 u h ( v ) ) , e < v < 1 ; 1 , v = 1 ;
which can be rewritten as I h ( u , v ) = 0 , v = 0 ; h 1 ( g u ( h ( v ) ) ) , 0 < v < 1 ; 1 , v = 1 ; with the function g u : R R is given by g u ( t ) = u h 1 ( t ) , t 0 ; 1 u h 1 ( t ) , t > 0 ; Then, we can get that g u ( 0 ) = u e , hence g u ( 0 + 0 ) g u ( 0 ) + g u ( 0 ) . Namely, g u is not an additive function. Thus, by Theorem 5.1 in [41], ( I h , U ) does not satisfy Equation (20). □
Here we provide an example for the above result.
Example 4.
Let I h be an h-implication with the additive generator h = ln u 1 u and U is the representable uninorm generated by the same generator. Then, it holds that I h ( 0.7 , U ( 0.4 , 0.7 ) ) 0.65 and U ( I h ( 0.7 , 0.4 ) , I h ( 0.7 , 0.7 ) ) 0.72 , thus ( I h , U ) does not satisfy Equation (20).
In general, the threshold-generated implications may not satisfy Equation (20) with idempotent uninorm U. Particularly, the h-implications do not satisfy Equation (20) with an idempotent uninorms. The results can be shown by the following examples and proposition, respectively.
Example 5.
Assume the uninorm
U = min ( u , v ) , v 1 u ; max ( u , v ) , e l s e
whose neutral element is 1 2 , and the 1 2 -generated implication I I R S I Y G be generated by the implications I R S and I Y G . Although the couples ( I R S , T M ) and ( I Y G , S M ) satisfy Equation (3) and Equation (4), respectively, the couple ( I I R S I Y G , U ) does not satisfy Equation (20), due to the fact that I I R S I Y G ( 0.9 , U ( 0.9 , 0.3 ) ) 0.91 > U ( I I R S I Y G ( 0.9 , 0.9 ) , I I R S I Y G ( 0.9 , 0.3 ) ) = 0 .
Proposition 6.
Let I h be an h-implication generated by an h-generator h and the strong negation N ( u ) be given by N ( u ) = h 1 ( h ( u ) ) .
(i) 
Let U be a left-continuous idempotent uninorm given by
U ( u , v ) = min ( u , v ) , v N ( u ) ; max ( u , v ) , e l s e
then Equation (20) does not hold for ( I h , U ) .
(ii) 
Let U be a right-continuous idempotent uninorm given by
U ( u , v ) = max ( u , v ) , v N ( u ) ; min ( u , v ) , e l s e
then Equation (20) does not hold for ( I h , U ) .
Proof. 
It is enough to prove the first case, since the other one can be checked similarly. Let 0 < v 0 < e < w 0 and v 0 N ( w 0 ) , then I ( u , v 0 ) < I ( u , w 0 ) for u > 0 and h ( v 0 ) h ( w 0 ) , i.e., h ( w 0 ) h ( v 0 ) 1 . Now assume 0 < u 0 < h ( w 0 ) h ( v 0 ) , then u 0 2 < h ( w 0 ) h ( v 0 ) , i.e., u 0 h ( v 0 ) < 1 u 0 h ( w 0 ) . Then N ( I h ( u 0 , v 0 ) ) = h 1 ( u 0 h ( v 0 ) ) < h 1 ( 1 u 0 h ( w 0 ) ) = I h ( u 0 , w 0 ) . Meanwhile, it holds that I h ( u 0 , U ( v 0 , w 0 ) ) = I h ( u 0 , min ( v 0 , w 0 ) ) = I h ( u 0 , v 0 ) and U ( I h ( u 0 , v 0 ) , I h ( u 0 , w 0 ) ) = max ( I h ( u 0 , v 0 ) , I h ( u 0 , w 0 ) ) = I ( u 0 , w 0 ) , which implies that
I h ( u 0 , U ( v 0 , w 0 ) ) < U ( I h ( u 0 , v 0 ) , I h ( u 0 , w 0 ) ) .
Therefore, ( I h , U ) does not satisfy Equation (20).□
The above results can also be exemplified as follows.
Example 6.
Assume that I h is an h-implication with additive generator h = ln u 1 u and the related strong negation of the idempotent uninorm U is defined by N ( u ) = h 1 ( h ( u ) ) = 1 u . Since I h ( 0.6 , U ( 0.6 , 0.3 ) ) 0.38 < U ( I h ( 0.6 , 0.6 ) , I h ( 0.6 , 0.3 ) ) 0.66 , then ( I h , U ) does not satisfy Equation (20).

3.2. The Case U ( e , e ) = e with e u < e

In this case, there are at least two proper idempotent elements of the involved uninorm U, then the uninorm cannot be representable. Moreover, by the idempotency of the idempotent uninorms, there is no need to consider the idempotent uninorms for this case. So, in this part, it is enough to discuss Equation (20) with the other two classes of uninorms, viz, the uninorm U U min or U max , and the uninorm U U c o s .

3.2.1. The Uninorm U U min or U max

In this part, we consider the class of uninorms U min or U max . Then, for U U min or U max with U ( e , e ) = e and e u < e , T ( u , v ) = U ( e u u , e u v ) e u is a t-norm, and S 1 ( u , v ) = U ( e u + ( e e u ) u , e u + ( e e u ) v ) e u e e u and S 2 ( u , v ) = U ( e + ( 1 e ) u , e + ( 1 e ) v ) e 1 e are t-conorms, respectively. Hence U can be given by
U ( u , v ) = e u T ( u e u , u e u ) , ( u , v ) [ 0 , e u ] 2 ; e u + ( e e u ) S 1 ( u e u e e u , v e u e e u ) , ( u , v ) [ e u , e ] 2 ; e + ( 1 e ) S 2 ( u e 1 e , v e 1 e ) , ( u , v ) [ e , 1 ] 2 ; min ( u , v ) o r max ( u , v ) , ( u , v ) [ 0 , e u ] × ] e u , 1 ] ] e u , 1 ] × [ 0 , e u ] ; max ( u , v ) , e l s e
For this case, the next result completely characterizes the solutions of Equation (20) with the uninorm U U min or U max and it guarantees the transformation of the distributivity property from the original implications to the threshold-generated counterpart.
Proposition 7.
Assume I 0 , I 1 , I 2 are fuzzy implications, the set E = { e u , e } , and the uninorm U U min or U max given by Equation (29), then the E-generated implication I E satisfies Equation (20) with the uninorm U if and only if the couple ( I 0 , T ) satisfies Equation (5) and
I i ( u , S i ( v , w ) ) = S i ( I i ( u , v ) , I i ( u , w ) ) , ( i { 1 , 2 } )
for v , w > 0 .
Proof. 
(⇐): We only consider the case that u > 0 .
(i)
If ( v , w ) [ 0 , e u ] 2 , then U ( v , w ) [ 0 , e u ] ,   I E ( u , v ) = e u I 0 ( u , v e u ) [ 0 , e u ] and I E ( u , w ) [ 0 , e u ] . Thus
I E ( u , U ( v , w ) ) = e u I 0 ( u , U ( v , w ) e u ) = e u I 0 ( u , e u T ( v e u , w e u ) e u ) = e u I 0 ( u , T ( v e u , w e u )
= e u T ( I 0 ( u , v e u ) , I 0 ( u , w e u ) ) = e u T ( I E ( u , v ) e u , I E ( u , w ) e u ) = U ( I E ( u , v ) , I E ( u , w ) ) .
(ii)
If ( v , w ) ] e u , e ] 2 , then U ( v , w ) ] e u , e ] ,   I E ( u , v ) = e u + ( e e u ) I 1 ( u , v e u e e u ) [ e u , e ] and I E ( u , w ) ] e u , e ] . Thus
I E ( u , U ( v , w ) ) = e u + ( e e u ) I 1 ( u , U ( v , w ) e u e e u )
= e u + ( e e u ) I 1 ( u , S 1 ( v e u e e u , w e u e e u ) )
= e u + ( e e u ) S 1 ( I 1 ( u , v e u e e u ) , I 1 ( u , w e u e e u ) )
= e u + ( e e u ) S 1 ( I E ( u , v ) e u e e u , I E ( u , w ) e u e e u ) = U ( I E ( u , v ) , I E ( u , w ) ) .
(iii)
If ( v , w ) ] e , 1 ] 2 , then U ( v , w ) ] e , 1 ] ,   I E ( u , v ) = e + ( 1 e ) I 2 ( u , v e 1 e ) [ e , 1 ] and I E ( u , w ) ] e , 1 ] . Thus
I E ( u , U ( v , w ) ) = e + ( 1 e ) I 2 ( u , U ( v , w ) e 1 e ) = e + ( 1 e ) I 2 ( u , S 2 ( v e 1 e , w e 1 e ) )
= e + ( 1 e ) S 2 ( I 2 ( u , v e 1 e ) , I 2 ( u , w e 1 e ) ) = e + ( 1 e ) S 2 ( I E ( u , v ) e 1 e , I E ( u , w ) e 1 e )
= U ( I E ( u , v ) , I E ( u , w ) ) .
(iv)
If ( v , w ) [ 0 , e u ] × ] e u , 1 ]  (Similar to the case ( w , v ) [ 0 , e u ] × ] e u , 1 ] ), then I E ( u , v ) [ 0 , e u ] and I E ( u , w ) ] e , 1 ] .
(a)
If U U max , then U ( v , w ) = max ( v , w ) , then
U ( I E ( u , v ) , I E ( u , w ) ) = max ( I E ( u , v ) , I E ( u , w ) )
= I E ( u , max ( v , w ) ) = I E ( u , U ( v , w ) ) ;
(b)
If U U min , then U ( v , w ) = min ( v , w ) , then
U ( I E ( u , v ) , I E ( u , w ) ) = min ( I E ( u , v ) , I E ( u , w ) )
= I E ( u , min ( v , w ) ) = I E ( u , U ( v , w ) ) .
(v)
If ( v , w ) ] e u , e ] × ] e , 1 ]  (Similarly for the case ( w , v ) ] e u , e ] × ] e , 1 ] ), then I E ( u , v ) ] e u , e ] and I E ( u , w ) ] e , 1 ] . Thus
U ( I E ( u , v ) , I E ( u , w ) ) = min ( I E ( u , v ) , I E ( u , w ) ) = I E ( u , min ( v , w ) ) = I E ( u , U ( v , w ) ) .
To sum up, the E-generated implication I E satisfies Equation (20) with the uninorm U.
(⇒): We divide the proof into three cases.
(i)
Let u > 0 , ( v , w ) [ 0 , 1 ] × [ 0 , 1 ] , then I E ( u , U ( e u v , e u w ) ) = U ( I E ( u , e u v ) , I E ( u , e u w ) ) .
L H S = I E ( u , e u T ( v , w ) ) = e u I 0 ( u , T ( v , w ) ) ;
R H S = U ( e u I 0 ( u , v ) , e u I 0 ( u , w ) ) = e u T ( I 0 ( u , v ) , I 0 ( u , w ) ) .
Then it follows that I 0 ( u , T ( v , w ) ) = T ( I 0 ( u , v ) , I 0 ( u , w ) ) . In addition, if u = 0 , I 0 ( 0 , T ( v , w ) ) = 1 = T ( 1 , 1 ) = T ( I 0 ( 0 , v ) , I 0 ( 0 , w ) ) . Thus ( I 0 , T ) satisfies Equation (5).
(ii)
Let u > 0 , ( v , w ) ] 0 , 1 ] 2 , then
I E ( u , U ( e u + ( e e u ) v , e u + ( e e u ) w ) ) = U ( I E ( u , e u + ( e e u ) v ) , I E ( u , e u + ( e e u ) w ) ) .
L H S = I E ( u , U ( e u + ( e e u ) v , e u + ( e e u ) w ) )
= I E ( u , e u + ( e e u ) S 1 ( v , w ) ) = e u + ( e e u ) I 1 ( u , S 1 ( v , w ) ) ;
R H S = U ( e u + ( e e u ) I 1 ( u , v ) , e u + ( e e u ) I 1 ( u , w ) ) = e u + ( e e u ) S 1 ( I 1 ( u , v ) , I 1 ( u , w ) ) .
Then it follows that I 1 ( u , S 1 ( v , w ) ) = S 1 ( I 1 ( u , v ) , I 1 ( u , w ) ) . Moreover, the last equation holds trivially for u = 0 . Thus, we get Equation (30) for i = 1 .
(iii)
Equation (30) for i = 2 can be checked similarly like (ii).
Remark 1.
For this case, if the initial implications satisfy the distributive equations with respect to the related t-norms or t-conorms, then the E-generated implication satisfies Equation (20). For instance, let T = T P , S 1 = S L K , S 2 = S P , e u = 1 3 , and e = 2 3 in Equation (31) and I E be the E-generated implication with the implications I 0 = I Y G and I 1 ( u , v ) = 1 , u = 0 v , e l s e ; and I 2 = I L t (the least implication), where the couple ( I Y G , T P ) satisfies Equation (3) and the couples ( I 1 , S L K ) and ( I 2 , S P ) satisfy Equation (4), then the E-generated implication I E satisfies Equation (20).

3.2.2. The Uninorm U U c o s

In this part, we focus on the the uninorm U U c o s . Since e u < e , then U has the form as Equation (19), i.e., U U c o s , m a x . The following result completely characterizes the solutions of Equation (20) for the uninorm U U c o s , m a x and it guarantees the transformation of the distributivity properties from the original implications to the threshold-generated counterpart.
Proposition 8.
Let U U c o s , m a x , E = { γ , δ } with e = γ or e = δ and I E be the E-generated implication generated by the implications I 0 , I 1 , I 2 with N I 0 ( u ) = I 0 ( u , 0 ) = 1 , u = 0 ; 0 , e l s e , and I 1 ( u , v ) > 0 and I 2 ( u , v ) > 0 for v > 0 . Then, the couple ( I E , U ) satisfies Equation (20) if and only if the couple ( I 0 , R ) satisfies Equation (20) and I i ( u , S i ( v , w ) ) = S i ( I i ( u , v ) , I i ( u , w ) ) ( i = 1 , 2 ) for v , w > 0 .
Proof. 
(⇒): Assume U is given by Equation (19) and ( U , I E ) satisfies Equation (20).
Let u > 0 and ( v , w ) [ 0 , 1 ] × [ 0 , 1 ] { ( 0 , 1 ) , ( 1 , 0 ) } , then γ v , γ w [ 0 , γ ] and I E ( u , U ( γ v , γ w ) ) = U ( I E ( u , γ v ) ,   I E ( u , γ w ) ) . By Equations (14) and (19), we can get γ I 0 ( u , U ( γ v , γ w ) γ ) = γ I 0 ( u , R ( v , w ) ) = U ( γ I 0 ( u , v ) , γ I 0 ( u , w ) ) = γ R ( I 0 ( u , v ) , I 0 ( u , w ) ) . Additionally, on one hand, if R is conjunctive, i.e., R ( 0 , 1 ) = 0 , then I 0 ( u , R ( 0 , 1 ) ) = I 0 ( u , 0 ) = 0 and R ( I 0 ( u , 0 ) , I 0 ( u , 1 ) ) = R ( 0 , 1 ) = 0 ; on the other hand, if R is disjunctive, i.e., R ( 0 , 1 ) = 1 , then I 0 ( u , R ( 0 , 1 ) ) = I 0 ( u , 1 ) = 1 and R ( I 0 ( u , 0 ) , I 0 ( u , 1 ) ) = R ( 0 , 1 ) = 1 . Thus, we have I 0 ( u , R ( v , w ) ) = R ( I 0 ( u , v ) , I 0 ( u , w ) ) for u > 0 and v , w [ 0 , 1 ] . Moreover, I 0 ( 0 , R ( v , w ) ) = R ( I 0 ( 0 , v ) , I 0 ( 0 , w ) ) = 1 . Hence, ( R , I 0 ) satisfies Equation (20).
Let u > 0 and v , w ] 0 , 1 ] , then γ + ( δ γ ) v , γ + ( δ γ ) w ] γ , δ ] and I E ( u , U ( γ + ( δ γ ) v , γ + ( δ γ ) w ) ) = U ( I E ( u , γ + ( δ γ ) v ) , I E ( u , γ + ( δ γ ) w ) ) . In virtue of Equations (2) and (19), we can get γ + ( δ γ ) I 1 ( u , U ( γ + ( δ γ ) v , γ + ( δ γ ) w ) γ δ γ ) = γ + ( δ γ ) I 1 ( u , S 1 ( v , w ) ) = U ( γ + ( δ γ ) I 1 ( u , v ) , γ + ( δ γ ) I 1 ( u , w ) ) = γ + ( δ γ ) S 1 ( I 1 ( u , v ) ,   I 1 ( u , w ) ) . Then, we have, for v , w ] 0 , 1 ] , I 1 ( u , S 1 ( v , w ) ) = S 1 ( I 1 ( u , v ) , I 1 ( u , w ) ) , as a result of the additional fact I 1 ( 0 , S 1 ( v , w ) ) = S 1 ( I 1 ( 0 , v ) , I 1 ( 0 , w ) ) = 1 . Similarly, for v , w ] 0 , 1 ] , we have I 2 ( u , S 2 ( v , w ) ) = S 2 ( I 2 ( u , v ) , I 2 ( u , w ) ) .
(⇐): Since I E ( 0 , U ( v , w ) ) = U ( I E ( 0 , v ) , I E ( 0 , w ) ) = 1 , then we consider the case u > 0 in the following.
(i)
If ( v , w ) [ 0 , γ ] 2 { ( 0 , γ ) , ( γ , 0 ) } , then U ( v , w ) [ 0 , γ ] and consequently,
I E ( u , U ( v , w ) ) = γ I 0 ( u , U ( v , w ) γ ) = γ I 0 ( u , R ( v γ , w γ ) )
U ( I E ( u , v ) , I E ( u , w ) ) = U ( γ I 0 ( u , v γ ) , γ I 0 ( u , w γ ) ) = γ R ( I 0 ( u , v γ ) , I 0 ( u , w γ ) ) .
Since ( R , I 0 ) satisfies Equation (20), then I E ( u , U ( v , w ) ) = U ( I E ( u , v ) , I E ( u , w ) ) . The last equation holds for v = 0 , w = γ (similarly v = γ , w = 0 ), since I E ( u , U ( 0 , γ ) ) = I E ( u , 0 ) = γ I 0 ( u ) = 0 and U ( I E ( u , 0 ) , I E ( u , γ ) ) = U ( γ I 0 ( u , 0 ) , γ   I 0 ( u , 1 ) ) = U ( 0 , γ ) = 0 .
(ii)
If v , w ] γ , δ ] , then U ( v , w ) ] γ , δ ] , which yields that I E ( u , U ( v , w ) ) = γ + ( δ γ ) I 1 ( u , U ( v , w ) γ δ γ ) = γ + ( δ γ ) I 1 ( u , S 1 ( v γ δ γ , w γ δ γ ) ) and U ( I E ( u , v ) , I E ( u , w ) ) = U ( γ + ( δ γ ) I 1 ( u , v γ δ γ ) , γ + ( δ γ ) I 1 ( u , w γ δ γ ) ) = γ + ( δ γ ) S 1 ( I 1 ( u , v γ δ γ ) , I 1 ( u , w γ δ γ ) ) . Since v γ δ γ , w γ δ γ ] 0 , 1 ] and I 1 ( u , S 1 ( v , w ) ) = S 1 ( I 1 ( u , v ) , I 1 ( u , w ) ) for v , w > 0 , then we get that I E ( u , U ( v , w ) ) = U ( I E ( u , v ) , I E ( u , w ) ) .
(iii)
If v , w ] δ , 1 ] , then we can check the equation similarly.
(iv)
If v = 0 , w ] γ , δ [ (similarly w = 0 , v ] γ , δ [ ), then U ( v , w ) = 0 , w γ δ γ < 1 , and I E ( u , w ) = γ + ( δ γ ) I 1 ( u , w γ δ γ ) ] γ , δ [ , thus I E ( u , U ( v , w ) ) = I E ( u , 0 ) = γ I 0 ( u , 0 ) = 0 = U ( 0 , γ + ( δ γ ) I 1 ( u , w γ δ γ ) ) = U ( I E ( u , v ) , I E ( u , w ) ) .
(v)
If v = 0 , w = δ  (similarly w = 0 , v = δ ), then U ( v , w ) = 0 or U ( v , w ) = δ . If U ( v , w ) = 0 , then I E ( u , U ( v , w ) ) = U ( I E ( u , v ) , I E ( u , w ) ) = 0 ; if U ( v , w ) = δ , then I E ( u , U ( v , w ) ) = I E ( u , δ ) = δ = U ( 0 , δ ) = U ( I E ( u , v ) , I E ( u , w ) ) .
(vi)
For the other cases, U ( v , w ) = max ( v , w ) and
U ( I E ( u , v ) , I E ( u , w ) ) = max ( I E ( u , v ) , I E ( u , w ) ) ,
then it can be directly checked that I E ( u , U ( v , w ) ) = U ( I E ( u , v ) , I E ( u , w ) ) .
Example 7.
(i) 
Let R be the (conjunctive or disjunctive) representable uninorm with its additive generator being h ( u ) = ln u 1 u ; I 0 ( u , v ) = 1 , u = 0 v , e l s e ; ; I 1 = I 2 = I h ; S 1 = S D and S 2 ( u , v ) = h 1 ( h ( u ) h ( v ) h ( u ) + h ( v ) ) , ( u , v ) [ 0 , 1 2 ] 2 h 1 ( h ( u ) + h ( v ) ) , ( u , v ) [ 1 2 , 1 ] 2 max ( u , v ) , e l s e ,
According to Example 5.9. in [41] and Propositions 31 and 32 in [47], ( I 0 , R ) satisfies Equation (20) and ( I i , S i ) satisfies Equation (4) for i = 1 , 2 . Thus the E-generated implication I E by I 0 , I 1 , I 2 with E = { 1 2 , 3 4 } satisfies Equation (20) with U = ( R , 1 4 ) , 1 2 , S 1 , 3 4 , S 2 c o s , m a x .
(ii) 
If, in (i), we only put I 0 ( u , v ) = 1 , u < 1 o r v = 1 v 2 2 v 2 2 v + 1 , e l s e , for which ( R , I 0 ) satisfies Equation (20) but N I 0 ( u ) 1 , u = 0 0 , e l s e then Equation (20) does not hold since I E ( 0.2 , U ( 0 , 0.6 ) ) = 0.5 < U ( I E ( 0.2 , 0 ) , I E ( 0.2 , 0.6 ) ) 0.62 .
(iii) 
If, in (i) we put I 1 = I R S and U = ( R , 1 4 ) , 1 2 , S M , 3 4 , S 2 c o s , m a x with U ( 0 , 3 4 ) = 3 4 , for which ( I R S , S M ) satisfies Equation (20) with U = S M and I = I R S but it does not hold that I 1 ( u , v ) > 0 for v > 0 . Then I E ( 0.7 , U ( 0.7 , 0 ) ) = 0 3 4 = U ( I E ( 0.7 , 0.7 ) , I E ( 0.7 , 0 ) ) .

3.3. The Case U ( e , e ) = e with e u > e

In this part, we discuss Equation (20) with the two classes of uninorms, viz, the uninorm U U min or U max and the uninorm U U c o s , just as the last part.

3.3.1. The Uninorm U U min or U max

Here, we consider the classes of uninorms U min or U max . For the case U ( e , e ) = e with e u > e , the uninorm U has at least two idempotent elements e , e u ; then, for ( u , v ) [ 0 , 1 ] × [ 0 , 1 ] , S ( u , v ) = U ( e u + ( 1 e u ) u , e u + ( 1 e u ) v ) e u 1 e u is a t-conorm and T 1 ( u , v ) = U ( e u , e v ) e and T 2 ( u , v ) = U ( e + ( e u e ) u , e + ( e u e ) v ) e e u e are two t-norms, respectively. Hence, U can be given by
U ( u , v ) = e T 1 ( u e , v e ) , ( u , v ) [ 0 , e ] 2 ; e + ( e u e ) T 2 ( u e e u e , v e e u e ) , ( u , v ) [ e , e u ] 2 ; e u + ( 1 e u ) S ( u e u 1 e u , v e u 1 e u ) , ( u , v ) [ e u , 1 ] 2 ; min ( u , v ) o r max ( u , v ) , ( u , v ) [ 0 , e u ] × e u , 1 e u , 1 × [ 0 , e u ] ; min ( u , v ) , e l s e
The following result completely characterizes the solutions of Equation (20) with the uninorm U U min or U max and it guarantees the transformation of this distributivity properties from the original implications to the threshold-generated counterpart.
Proposition 9.
Let I 0 , I 1 , I 2 be fuzzy implications, the set E = { e , e u } , and the uninorm U U min or U max be given by Equation (31) with T 2 having no zero divisors; then, the E-generated implication I E satisfies Equation (20) with the uninorm U if and only if the couple ( I 0 , T 1 ) satisfies Equation (5) with U = T 1 and
I 1 ( u , T 2 ( v , w ) ) = T 2 ( I 1 ( u , v ) , I 1 ( u , w ) )
I 2 ( u , S ( v , w ) ) = S ( I 2 ( u , v ) , I 2 ( u , w ) )
for v , w > 0 .
Proof. 
Since the similar structure of the uninorms given by Equations (29) and (31), by exploring the relationships between Equation (20) and the properties of the scaled t-norms T 1 and T 2 and t-conorm S for the uninorm by Equation (31), the results can be checked in a way similar to that of Proposition 7. □

3.3.2. The Uninorm U U c o s

Here, we consider the the uninorm U U c o s . Since e u > e , U has the form as Equation (18), i.e., U U c o s , m i n . The next result completely characterizes the solutions of Equation (20) for the uninorm U U c o s , m i n and it guarantees the transformation of the distributivity properties from the original implications to the threshold-generated counterpart.
Proposition 10.
Let U U c o s , m i n given by Equation (18) and E = { α , β } , I E be the E-generated implication generated by the implications I 0 , I 1 , I 2 with I 0 ( u , v ) < 1 for u > 0 and v < 1 , and I 1 ( u , v ) > 0 for every v > 0 , and the pertaining t-norm T 2 having no zero divisors. Then the couple ( I E , U ) satisfies Equation (20) if and only if the couple ( I 0 , T 1 ) satisfies Equation (5) and
I 1 ( u , T 2 ( v , w ) ) = T 2 ( I 1 ( u , v ) , I 1 ( u , w ) )
I 2 ( u , R ( v , w ) ) = R ( I 2 ( u , v ) , I 2 ( u , w ) )
for v , w > 0 .
Proof. 
(⇒): Assume ( I E , U ) satisfies I E ( u , U ( v , w ) ) = U ( I E ( u , v ) , I E ( u , w ) ) for every u , v , w [ 0 , 1 ] .
If u > 0 and ( v , w ) [ 0 , 1 ] × [ 0 , 1 ] , then
I E ( u , U ( α v , α w ) ) = α I 0 ( u , U ( α v , α w ) α ) = α I 0 ( u , T 1 ( v , w ) ) ,
U ( I E ( u , α v ) , I E ( u , α w ) ) = U ( α I 0 ( u , v ) , α I 0 ( u , w ) ) = α T 1 ( I 0 ( u , v ) , I 0 ( u , w ) ) .
With Equation (20), we have I 0 ( u , T 1 ( v , w ) ) = T 1 ( I 0 ( u , v ) , I 0 ( u , w ) ) . Moreover, I 0 ( 0 , T 1 ( v , w ) )   = T 1 ( I 0 ( 0 , v ) , I 0 ( 0 , w ) ) = 1 , thus ( I 0 , T 1 ) satisfies Equation (5).
By exploring the relationships between Equation (20) and the properties of the scaled t-norms T 2 and uninorm R for the uninorm U by Equation (18), the other two equations can be obtained similarly as Proposition 7.
(⇐): Since I E ( u , U ( v , w ) ) = U ( I E ( u , v ) , I E ( u , w ) ) = 1 for u = 0 , then we only focus on u > 0 in what follows.
(i)
If v , w [ 0 , α ] , then
I E ( u , U ( v , w ) ) = α I 0 ( u , U ( v , w ) α ) = α I 0 ( u , T 1 ( v α , w α ) )
= α T 1 ( I 0 ( u , v α ) , I 0 ( u , w α ) ) = U ( I E ( u , v ) , I E ( u , w ) )
since ( I 0 , T 1 ) satisfies Equation (20).
(ii)
If v , w ] α , β ] , then
I E ( u , U ( v , w ) ) = α + ( β α ) I 1 ( u , U ( v , w ) α β α )
= α + ( β α ) I 1 ( u , T 2 ( v α β α , w α β α ) ) = α + ( β α ) T 2 ( I 1 ( u , v α β α ) , I 1 ( u , w α β α ) )
from the fact that I 1 ( u , T 2 ( v , w ) ) = T 2 ( I 1 ( u , v ) , I 1 ( u , w ) ) for v , w > 0 .
(iii)
If v , w ] β , 1 [ , then Equation (20) can be checked similarly from the fact that I 2 ( u , S ( v , w ) ) = S ( I 2 ( u , v ) , I 2 ( u , w ) ) holds for every v , w > 0 .
(iv)
If v = 1  (similarly w = 1 ), then the following subcases need be considered.
(a)
If w ] α , 1 ] , then U ( v , w ) = 1 with Equation (18), I E ( u , v ) = I E ( u , 1 ) = 1 and I E ( u , w ) ] α , 1 ] with the fact I 1 ( u , v ) > 0 for v > 0 , hence I E ( u , U ( v , w ) ) = 1 = U ( I E ( u , v ) , I E ( u , w ) ) with Equations (14) and (18).
(b)
If w = α , then we have
I E ( u , U ( v , w ) ) = I E ( u , U ( 1 , α ) ) = 1 = U ( 1 , α ) = U ( I E ( u , 1 ) , I E ( u , α ) )
for the case U ( 1 , α ) = 1 ; and
I E ( u , U ( v , w ) ) = I E ( u , U ( 1 , α ) ) = α = U ( 1 , α ) = U ( I E ( u , 1 ) , I E ( u , α ) )
for the case U ( 1 , α ) = α .
(c)
If w [ 0 , α [ , then it holds that I E ( u , w ) < α with the fact that I 0 ( u , v ) < 1 for u > 0 , v < 1 and then I E ( u , U ( v , w ) ) = I E ( u , U ( 1 , w ) ) = I E ( u , min ( 1 , w ) ) = I E ( u , w ) = U ( 1 , I E ( u , w ) ) .
(v)
For the other cases, we have U ( v , w ) = max ( v , w ) and U ( I E ( u , v ) , I E ( u , w ) ) = max ( I E ( u , v ) , I E ( u , w ) ) , thus I E ( u , U ( v , w ) ) = U ( I E ( u , v ) , I E ( u , w ) ) .
With the above proposition, we can see that, under some minimal conditions, the threshold-generated implication well preserves the distributivity over the fuzzy connectives.
Example 8.
(i) 
Let the uninorm U = T P , 1 4 , T P , 1 2 , ( R , 3 4 ) c o s , m i n , where R is a (conjunctive or disjunctive) representable uninorm with additive generator h ( u ) = ln u 1 u , I 0 = I Y G , and I 1 ( u , v ) = 1 , u = 0 v , e l s e ; , and I 2 ( u , v ) = 1 , u = 0 v 2 2 v 2 2 v + 1 , e l s e ; and I E be the E-generated implication by I 0 , I 1 , I 2 with E = { 1 4 , 1 2 } . It holds that, ( I 0 , T P ) and ( I 1 , T P ) satisfy Equation (5) and the couple ( I 2 , R ) satisfies Equation (20) (see [41]) with U = R . We only check Equation (5) for the first couple as an illustration. If u = 0 and v w = 0 , then it holds that I Y G ( u , T P ( v , w ) ) = I Y G ( u , v w ) = 1 = T P ( I Y G ( u , v ) , I Y G ( u , w ) ) ; If u > 0 or v w > 0 , then I Y G ( u , T P ( v , w ) ) = I Y G ( u , v w ) = ( v w ) u = v u w u = T P ( I Y G ( u , v ) , I Y G ( u , w ) ) . Then according to Propostion 10, ( I E , U ) satisfies Equation (20).
(ii) 
Let U ( 1 4 , 1 ) = U ( 1 , 1 4 ) = 1 4 and I 1 = I L t in (i). It can be checked that the couple ( I 1 , T L K ) satisfies Equation (3) and there is u 0 [ 0 , 1 ] , v 0 > 0 such that I 1 ( u 0 , v 0 ) = 0 . However, it can be obtained that I E ( 0.1 , U ( 0.3 , 1 ) ) = 1 0.25 = U ( I E ( 0.1 , 0.3 ) , I E ( 0.1 , 1 ) ) .
(iii) 
Let U ( 1 4 , 1 ) = U ( 1 , 1 4 ) = 1 and I 0 = I G t in (i). It can be checked that the couple ( I 0 , T P ) satisfies Equation (3) and there is u 0 > 0 and v 0 < 0 such that I 0 ( u 0 , v 0 ) = 1 . However, it can be obtained that I E ( 0.1 , U ( 0.1 , 1 ) ) = 0.25 1 = U ( I E ( 0.1 , 0.1 ) , I E ( 0.1 , 1 ) ) .

4. On the Equation I ( U 1 ( u , v ) , w ) ) = U 2 ( I ( u , w ) , I ( v , w ) )

In this section, we focus on Equation (6); it turns out that Equation (6) reduces to the trivial case under some requirements.
According to [41], if the triple ( I , U 1 , U 2 ) satisfies Equation (6), then U 1 is conjunctive (disjunctive) if and only if U 2 is disjunctive (conjunctive). Moreover, we have the following results.
Proposition 11.
If the triple ( I I 1 I 2 , U 1 , U 2 ) satisfies Equation (6), then U 2 ( e , e ) = e ; if the implications I 1 and I 2 satisfy (NP), then U 2 is idempotent.
Proof. 
The results can be checked by putting w = e and u = v = 1 in Equation (6), respectively. □
Proposition 12.
Let the implications I 1 and I 2 satisfy (NP), and there is some w 0 [ 0 , 1 [ such that I 1 ( · , w 0 ) or I 2 ( · , w 0 ) is one-to-one. If the triple ( I I 1 I 2 , U 1 , U 2 ) satisfies Equation (6), then U 1 is idempotent.
Proof. 
We can get the result by putting w = w 0 and u = v in Equation (6). □
The idempotent uninorms are extensively investigated in [59,61]. T-(co)norms can be uniquely determined by their idempotency while uninorms cannot. However, from Theorem 6, for an idempotent uninorm U, U ( u , v ) = min ( u , v ) for every ( u , v ) [ 0 , e u [ × [ 0 , e u [ and U ( u , v ) = max ( u , v ) for ( u , v ) ] e u , 1 ] × ] e u , 1 ] . Then we can derive the results as follows.
Theorem 7.
Assume I 1 and I 2 are two fuzzy implications satisfying (NP) and the following conditions are satisfied.
(i) 
I 1 and I 2 are strictly decreasing with respect to the first variable whenever the second variable belongs to ] 0 , 1 [ ;
(ii) 
There is some w 0 [ 0 , 1 [ such that I 1 ( · , w 0 ) or I 2 ( · , w 0 ) is one-to-one;
(iii) 
I 1 ( u , v ) , I 2 ( u , v ) ] 0 , 1 [ whenever u > 0 and v < 1 ;
(iv) 
U i is a uninorms with its neutral element being e u i   ( i = 1 , 2 ) .
Then the triple ( I I 1 I 2 , U 1 , U 2 ) satisfies Equation (6) if and only if ( U 1 = S M , U 2 = T M ) or ( U 1 = T M , U 2 = S M ) .
Proof. 
(⇒) Assume 0 < e u 1 < 1 , we focus on two cases as follows:
For the case e u 2 > 0 , Let u , v , w ] 0 , min ( e , e u 1 , e u 2 ) [ , then e I 1 ( min ( u , v ) , w e ) ) = min ( e I 1 ( u , w e ) , e I 1 ( v , w e ) ) , which contradicts the decreasingness of I 1 in the first variable whenever u v ;
For the case e u 2 = 0 , U 2 = S M = max . Let u , v , w ] min ( e , e u 1 ) , 1 [ , then we can get a similar contradiction as above.
Therefore, e u 1 = 0 or e u 1 = 1 . Thus, we proceed with the proof in cases as follows.
(i)
If e u 1 = 0 , i.e., U 1 = S M , then Equation (6) becomes
I I 1 I 2 ( max ( u , v ) , w ) ) = U 2 ( I I 1 I 2 ( u , w ) , I I 1 I 2 ( v , w ) ) .
Assume e u 2 < 1 . Put u , v , w ] max ( e , e u 2 ) , 1 [ , then we have
I I 1 I 2 ( max ( u , v ) , w ) ) = max ( I I 1 I 2 ( u , w ) , I I 1 I 2 ( v , w ) ) ,
i.e., e + ( 1 e ) I 2 ( max ( u , v ) , w e 1 e ) ) = max ( e + ( 1 e ) I 2 ( u , w e 1 e ) , ( e + ( 1 e ) I 2 ( v , w e 1 e ) ) , which contradicts the decreasingness of I 2 in the first variable whenever u v in this case. Thus e u 2 = 1 , i.e., U 2 = T M .
(ii)
If e u 1 = 1 , i.e., U 1 = T M , then Equation (6) becomes
I I 1 I 2 ( min ( u , v ) , w ) ) = U 2 ( I I 1 I 2 ( u , w ) , I I 1 I 2 ( v , w ) ) .
Assume e u 2 > 0 . Put u , v , w ] 0 , min ( e , e u 2 ) [ , then it holds that I I 1 I 2 ( min ( u , v ) , w ) ) = min ( I I 1 I 2 ( u , w ) ,   I I 1 I 2 ( v , w ) ) , i.e.,
e I 1 ( min ( u , v ) , w e ) ) = min ( e I 1 ( u , w e ) , ( e I 1 ( v , w e ) ) ,
which contradicts the decreasingness of I 1 in the first variable whenever u v in this case. Thus e u 2 = 0 , i.e., U 2 = S M .
To sum up, ( U 1 = S M , U 2 = T M ) or ( U 1 = T M , U 2 = S M ) .
(⇐) It can be checked with the increasingness of I I 1 I 2 in the first variable if ( U 1 = S M , U 2 = T M ) or ( U 1 = T M , U 2 = S M ) .□
Corollary 1.
If h is an h-generator and U 1 and U 2 are uninorms, then the triple ( I h , U 1 , U 2 ) satisfies Equation (6) if and only if ( U 1 = S M , U 2 = T M ) or ( U 1 = T M , U 2 = S M ) .
Under the referred conditions, Equation (6) reduces to the trivial cases. Nevertheless, the problem with the original implications being free from the restricted conditions in the threshold generation is still open. However, the existing results show that [41] that if both U 1 and U 2 are representable uninorms, then for Equation (6) there are no solutions I which are fuzzy implications. Thus, we can get the following result trivially.
Proposition 13.
Assume I 1 and I 2 are fuzzy implications, and U 1 and U 2 be representable uninorms, then the triple ( I I 1 I 2 , U 1 , U 2 ) does not satisfy Equation (6). In particular, if h is an h-generator, then the triple ( I h , U 1 , U 2 ) does not satisfy Equation (6).

5. Concluding Remarks

The threshold-generated implications preserve most of the established properties, particularly the distributivity over t-norms and t-conorms, under certain minimal necessary conditions. In this paper, under some necessary conditions, the threshold-generated implications also preserve the distributivity over fuzzy connectives with respect to Equation (7) when the uninorm U is restricted to some commonly referred classes of uninorms (see Table 3, where indicates the preservation of distributivity, while × does not.). At the same time, the threshold-generated implications may not preserve the distributivity for some other classes of uninorms, which are illustrated by various examples and propositions. As byproducts, it is shown that the h-implications do not satisfy the distributive Equation (7) when the uninorm is the representable uninorm in Theorem 4 and the idempotent uninorm in Theorem 6, respectively. It is shown that Equation (6) reduces to the trivial case if the threshold-generated implication is restricted to the referred requirement in Theorem 7. However, Equation (6) with more general conditions on the implications still needs extensive investigation.
In recent studies, many constructing methods are developed to generate new classes of fuzzy implications, such as those methods in [9,28]. The distributivity properties of the generated fuzzy over fuzzy connective are interesting topics for future research. In addition, the balanced generators introduced by Kamila and Mirko [62] bring some novel insights on local properties of t-norms from the angle of geometry. Since many implications can be generated by the methods in [11,18] using the particular balanced generators, it is quite necessary to investigate some geometric properties of the generated implications.

Funding

The work was supported by Jiangxi Natural Science Foundation (No. 20224BAB201015), the National Natural Science Foundation of China (No. 12461092), the Scientific Research Foundation of Jiangxi Provincial Education Department (No. GJJ2202014), Humanities and Social Sciences Projects for Universities in Jiangxi Province of China under Grant GL18212 (The funding was acquired in Modern Economics & Management, Jiangxi University of Finance & Economics), and Nanchang Key Laboratory of Metaverse Generative AI Education.

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Baczyński, M.; Jayaram, B. Fuzzy Implications; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2008; Volume 231. [Google Scholar]
  2. Fodor, J.C.; Roubens, M. Fuzzy Preference Modelling and Multicriteria Decision Support; Springer: Berlin/Heidelberg, Germany, 1994; Volume 14. [Google Scholar]
  3. Durante, F.; Klement, E.P.; Mesiar, R.; Sempi, C. Conjunctors and their residual implicators: Characterizations and construction methods. Mediterr. J. Math. 2007, 4, 343–356. [Google Scholar] [CrossRef]
  4. Carbonell, M.; Torrens, J. Continuous R-implications generated from representable aggregation functions. Fuzzy Sets Syst. 2010, 161, 2276–2289. [Google Scholar] [CrossRef]
  5. Aguiló, I.; Suñer, J.; Torrens, J. A characterization of residual implications derived from left-continuous uninorms. Inf. Sci. 2010, 180, 3992–4005. [Google Scholar] [CrossRef]
  6. Baczyński, M.; Jayaram, B. (U, N)-implications and their characterizations. Fuzzy Sets Syst. 2009, 160, 2049–2062. [Google Scholar] [CrossRef]
  7. Baets, B.D.; Fodor, J. Residual operators of uninorms. Soft Comput. 1999, 3, 89–100. [Google Scholar] [CrossRef]
  8. Mas, M.; Monserrat, M.; Torrens, J. Two types of implications derived from uninorms. Fuzzy Sets Syst. 2007, 158, 2612–2626. [Google Scholar] [CrossRef]
  9. Jia, Z.; Qiao, J.; Chen, M. On fuzzy implications derived from multiplicative generator pair of overlap functions. Res. Sq. 2024. [Google Scholar] [CrossRef]
  10. Pinheiro, J.; Santos, H.; Dimuro, G.P.; Bedregal, B.; Santiago, R.H.N.; Fernandez, J.; Bustince, H. On Fuzzy Implications Derived from General Overlap Functions and Their Relation to Other Classes. Axioms 2023, 12, 17. [Google Scholar] [CrossRef]
  11. Yager, R.R. On some new classes of implication operators and their role in approximate reasoning. Inf. Sci. 2004, 167, 193–216. [Google Scholar] [CrossRef]
  12. Baczyński, M.; Jayaram, B. Yager’s classes of fuzzy implications: Some properties and intersections. Kybernetika 2007, 43, 157–182. [Google Scholar]
  13. Jayaram, B. Yager’s new class of implications Jf and some classical tautologies. Inf. Sci. 2007, 177, 930–946. [Google Scholar] [CrossRef]
  14. Massanet, S.; Torrens, J. Intersection of Yager’s implications with QL- and D-implications. Int. J. Approx. Reason. 2012, 53, 467–479. [Google Scholar] [CrossRef]
  15. Massanet, S.; Torrens, J. On the characterization of Yager’s implications. Inf. Sci. 2012, 201, 1–18. [Google Scholar] [CrossRef]
  16. Zhou, H. Characterizations of fuzzy implications generated by continuous multiplicative generators of t-norms. IEEE Trans. Fuzzy Syst. 2021, 29, 2988–3002. [Google Scholar] [CrossRef]
  17. Massanet, S.; Torrens, J. On a new class of fuzzy implications: h-implications and generalizations. Inf. Sci. 2011, 181, 2111–2127. [Google Scholar] [CrossRef]
  18. Liu, H. On a new class of implications:(g, min)-implications and several classical tautologies. Int. J. Uncertainty Fuzziness Knowl.-Based Syst. 2012, 20, 1–20. [Google Scholar] [CrossRef]
  19. Liu, H. A new class of fuzzy implications derived from generalized h -generators. Fuzzy Sets Syst. 2013, 224, 63–92. [Google Scholar] [CrossRef]
  20. Liu, H. Fuzzy implications derived from generalized additive generators of representable uninorms. IEEE Trans. Fuzzy Syst. 2013, 21, 555–566. [Google Scholar] [CrossRef]
  21. Xie, A.; Liu, H. A generalization of Yager’s f-generated implications. Int. J. Approx. Reason. 2013, 54, 35–46. [Google Scholar] [CrossRef]
  22. Zhang, F.; Liu, H. On a new class of implications: (g, u)-implications and the distributive equations. Int. J. Approx. Reason. 2013, 54, 1049–1065. [Google Scholar] [CrossRef]
  23. Hliněná, D.; Kalina, M.; Král, P. A class of implications related to Yager’s f -implications. Inf. Sci. 2014, 260, 171–184. [Google Scholar] [CrossRef]
  24. Massanet, S.; Torrens, J. Threshold generation method of construction of a new implication from two given ones. Fuzzy Sets Syst. 2012, 205, 50–75. [Google Scholar] [CrossRef]
  25. Massanet, S.; Torrens, J. On the vertical threshold generation method of fuzzy implication and its properties. Fuzzy Sets Syst. 2013, 226, 32–52. [Google Scholar] [CrossRef]
  26. Su, Y.; Xie, A.; Liu, H. On ordinal sum implications. Inf. Sci. 2015, 293, 251–262. [Google Scholar] [CrossRef]
  27. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  28. Cheng, Y.; Zhao, B.; Lu, J. On vertical ordinal sums of fuzzy implications. Comput. Appl. Math. 2025, 44, 208. [Google Scholar] [CrossRef]
  29. Combs, W.E.; Andrews, J.E. Combinatorial rule explosion eliminated by a fuzzy rule configuration. IEEE Trans. Fuzzy Syst. 1998, 6, 1–11. [Google Scholar] [CrossRef]
  30. Trillas, E.; Alsina, C. On the law [pqr]=[(pr)⋁(qr)] in fuzzy logic. IEEE Trans. Fuzzy Syst. 2002, 10, 84–88. [Google Scholar] [CrossRef] [PubMed]
  31. Jayaram, B.; Mohan Rao, C.J. On the distributivity of implication operators over t and s-norms. IEEE Trans. Fuzzy Syst. 2004, 12, 194–198. [Google Scholar]
  32. Baczyński, M.; Qin, F. Some remarks on the distributive equation of fuzzy implication and the contrapositive symmetry for continuous, Archimedean t-norms. Int. J. Approx. Reason. 2013, 54, 290–296. [Google Scholar] [CrossRef]
  33. Qin, F.; Yang, L. Distributive equations of implications based on nilpotent triangular norms. Int. J. Approx. Reason. 2010, 51, 984–992. [Google Scholar] [CrossRef]
  34. Baczyński, M. On the distributivity of implication operations over t-representable t-norms generated from strict t-norms in interval-valued fuzzy sets theory. In Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Methods; Springer: Berlin/Heidelberg, Germany, 2010; pp. 637–646. [Google Scholar]
  35. Baczyński, M. On two distributivity equations for fuzzy implications and continuous, Archimedean t-norms and t-conorms. Fuzzy Sets Syst. 2013, 211, 34–54. [Google Scholar] [CrossRef]
  36. Baczyński, M.; Jayaram, B. On the distributivity of fuzzy implications over nilpotent or strict triangular conorms. IEEE Trans. Fuzzy Syst. 2009, 17, 590–603. [Google Scholar] [CrossRef]
  37. Qin, F.; Baczyński, M. Distributivity equations of implications based on continuous triangular conorms (II). Fuzzy Sets Syst. 2014, 240, 86–102. [Google Scholar] [CrossRef]
  38. Qin, F.; Baczynski, M.; Xie, A. Distributive equations of implications based on continuous triangular norms (I). IEEE Trans. Fuzzy Syst. 2012, 20, 153–167. [Google Scholar] [CrossRef]
  39. Xie, A.; Li, C.; Liu, H. Distributive equations of fuzzy implications based on continuous triangular conorms given as ordinal sums. IEEE Trans. Fuzzy Syst. 2013, 21, 541–554. [Google Scholar] [CrossRef]
  40. Xie, A.; Liu, H.; Zhang, F.; Li, C. On the distributivity of fuzzy implications over continuous archimedean t-conorms and continuous t-conorms given as ordinal sums. Fuzzy Sets Syst. 2012, 205, 76–100. [Google Scholar] [CrossRef]
  41. Baczyński, M. On the distributivity of fuzzy implications over representable uninorms. Fuzzy Sets Syst. 2010, 161, 2256–2275. [Google Scholar] [CrossRef]
  42. Qin, F.; Bin, Z. The distributive equations for idempotent uninorms and nullnorms. Fuzzy Sets Syst. 2005, 155, 446–458. [Google Scholar] [CrossRef]
  43. Baczyński, M. Distributivity of implication operations over t-representable t-norms in interval-valued fuzzy set theory: The case of nilpotent t-norms. Inf. Sci. 2014, 257, 388–399. [Google Scholar] [CrossRef]
  44. Aguilera, D.R.; Torrens, J. Distributivity of strong implications over conjunctive and disjunctive uninorms. Kybernetika 2006, 42, 319–336. [Google Scholar]
  45. Aguilera, D.R.; Torrens, J. Distributivity of residual implications over conjunctive and disjunctive uninorms. Fuzzy Sets Syst. 2007, 158, 23–37. [Google Scholar] [CrossRef]
  46. Aguilera, D.R.; Torrens, J. S-and R-implications from uninorms continuous in ]0, 1[2 and their distributivity over uninorms. Fuzzy Sets Syst. 2009, 160, 832–852. [Google Scholar] [CrossRef]
  47. Massanet, S.; Torrens, J. On some properties of threshold generated implications. Fuzzy Sets Syst. 2012, 205, 30–49. [Google Scholar] [CrossRef]
  48. Ayaz, T.; Garg, H.; Liu, X.; Emam, W. Prioritized aggregation operators based on Schweizer-Sklar t-norm for linear Diophantine fuzzy sets and their application in green sustainable chain. Alex. Eng. J. 2023, 82, 587–600. [Google Scholar]
  49. Li, H.; Yi, Z.; Fang, Y. Portfolio selection under uncertainty by the ordered modular average operator. Fuzzy Optim. Decis. Mak. 2019, 18, 1–14. [Google Scholar] [CrossRef]
  50. Wan, S.; Yi, Z. Power average of trapezoidal intuitionistic fuzzy numbers using strict t-norms and t-conorms. IEEE Trans. Fuzzy Syst. 2016, 24, 1035–1047. [Google Scholar] [CrossRef]
  51. Yao, L.; Yi, Z. A DEMATEL-Based method for linguistic multiple attributes group decision making using strict t-norms and t-conorms. Systems 2022, 10, 98. [Google Scholar] [CrossRef]
  52. Yi, Z. Decision-making based on probabilistic linguistic term sets without loss of information. Complex Intell. Syst. 2022, 8, 2435–2449. [Google Scholar] [CrossRef]
  53. Yi, Z.; Yao, L.; Garg, H. Power geometric operations of trapezoidal Atanassov’s intuitionistic fuzzy numbers based on strict t-norms and t-conorms and its application to multiple attribute group decision making. Int. J. Fuzzy Syst 2024, 26, 239–259. [Google Scholar] [CrossRef]
  54. Yi, Z.; Li, H. Triangular norm-based cuts and possibility characteristics of triangular intuitionistic fuzzy numbers for decision making. Int. J. Intell. Syst. 2018, 33, 1165–1179. [Google Scholar] [CrossRef]
  55. Alsina, C.; Frank, M.J.; Schweizer, B. Associative Functions:Triangular Norms and Copulas; World Scientific Publishing Co.: Singapore, 2006. [Google Scholar]
  56. Yi, Z.; Qin, F. Extended threshold generation of a new class of fuzzy implications. In Advances in Intelligent Systems and Computing; Fan, T.H., Chen, S.L., Wang, S.M., Li, Y.M., Eds.; Quantitative Logic and Soft Computing 2016; Springer: Cham, Switzerland, 2016; Volume 510. [Google Scholar]
  57. Yi, Z.; Yao, L.; Qin, F. Some Properties of the Extended Threshold Generated Implications. Fuzzy Inf. Eng. 2024, 16, 175–193. [Google Scholar] [CrossRef]
  58. Fodor, J.C.; Yager, R.R.; Rybalov, A. Structure of uninorms. Int. J. Uncertainty Fuzziness Knowl.-Based Syst. 1997, 5, 411–427. [Google Scholar] [CrossRef]
  59. Baets, B.D. Idempotent uninorms. Eur. J. Oper. Res. 1999, 118, 631–642. [Google Scholar] [CrossRef]
  60. Hu, S.; Li, Z. The structure of continuous uni-norms. Fuzzy Sets Syst. 2001, 124, 43–52. [Google Scholar] [CrossRef]
  61. Mayor, G.; Martin, J.; Torrens, J. On locally internal monotonic operations. Fuzzy Sets Syst. 2003, 137, 27–42. [Google Scholar] [CrossRef]
  62. Kamila, H.; Mirko, N. Geometry of generators of triangular norms and copulas. Depend. Model. 2024, 12, 20240004. [Google Scholar] [CrossRef]
Table 1. Main notations.
Table 1. Main notations.
NotationDescription
IFuzzy implication
I f f-implication
I g g-implication
I h h-implication
I I 1 I 2 e-threshold-generated implication
I E E-threshold-generated implication
Tt-norm
St-conorm
Uuninorm
U R Set of representable uninorms
U c o s Set of uninorms continous in ] 0 , 1 [ × ] 0 , 1 [ .
U I Set of idempotent uninorms
Table 2. Basic Implications.
Table 2. Basic Implications.
NameFormula
ukasiewicz I L K ( u , v ) = min ( 1 , 1 u + v )
Reichenbach I R C ( u , v ) = 1 u + u v
Kleene-Dienes I K D ( u , v ) = max ( 1 u , v )
Gödel I G D ( u , v ) = 1 , u v ; v , u > v ;
Goguen I G G ( u , v ) = 1 , u v ; v u , u > v ;
Rescher I R S ( u , v ) = 1 , u v ; 0 , u > v ;
Yager I Y G ( u , v ) = 1 , u = 0 a n d v = 0 ; v u , u > 0 o r v > 0 ;
Weber I W B ( u , v ) = 1 , u < 1 ; v , u = 1 ;
Foder I F D ( u , v ) = 1 , u v ; max ( 1 u , v ) u > v ;
Least I L t ( u , v ) = 1 , u = 0 o r v = 1 ; 0 u > 0 a n d v < 1 ;
Greatest I G t ( u , v ) = 1 , u < 1 o r v > 0 ; 0 u = 1 a n d v = 0 ;
Table 3. Main results on the preservation of distributivity about Equation (20).
Table 3. Main results on the preservation of distributivity about Equation (20).
Cases U min or U max U cos U R U I
e u = e (Proposition 3)× (Example 2)× (Example 3)× (Example 5)
e u < e (Proposition 7) (Proposition 8)
e u > e (Proposition 9) (Proposition 10)
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

Yi, Z. A Systematic Study on Distributivity of Threshold-Generated Implications over Uninorms. Axioms 2025, 14, 807. https://doi.org/10.3390/axioms14110807

AMA Style

Yi Z. A Systematic Study on Distributivity of Threshold-Generated Implications over Uninorms. Axioms. 2025; 14(11):807. https://doi.org/10.3390/axioms14110807

Chicago/Turabian Style

Yi, Zhihong. 2025. "A Systematic Study on Distributivity of Threshold-Generated Implications over Uninorms" Axioms 14, no. 11: 807. https://doi.org/10.3390/axioms14110807

APA Style

Yi, Z. (2025). A Systematic Study on Distributivity of Threshold-Generated Implications over Uninorms. Axioms, 14(11), 807. https://doi.org/10.3390/axioms14110807

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