Next Article in Journal
Innovative Investment Models with Frequent Payments of Tax on Income and of Interest on Debt
Previous Article in Journal
A Novel Multi-Criteria Group Decision-Making Approach Based on Bonferroni and Heronian Mean Operators under Hesitant 2-Tuple Linguistic Environment
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Study of Two Families of Generalized Yager’s Implications for Describing the Structure of Generalized (h,e)-Implications

by
Raquel Fernandez-Peralta
1,2,*,
Sebastia Massanet
1,2 and
Arnau Mir
1,2
1
Soft Computing, Image Processing and Aggregation (SCOPIA) Research Group, Department of Mathematics and Computer Science, University of the Balearic Islands, 07122 Palma, Spain
2
Health Research Institute of the Balearic Islands (IdISBa), 07010 Palma, Spain
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(13), 1490; https://doi.org/10.3390/math9131490
Submission received: 25 May 2021 / Revised: 17 June 2021 / Accepted: 21 June 2021 / Published: 24 June 2021
(This article belongs to the Section Fuzzy Sets, Systems and Decision Making)

Abstract

:
In this study, we analyze the family of generalized ( h , e ) -implications. We determine when this family fulfills some of the main additional properties of fuzzy implication functions and we obtain a representation theorem that describes the structure of a generalized ( h , e ) -implication in terms of two families of fuzzy implication functions. These two families can be interpreted as particular cases of the ( f , g ) and ( g , f ) -implications, which are two families of fuzzy implication functions that generalize the well-known f and g-generated implications proposed by Yager through a generalization of the internal factors x and 1 x , respectively. The behavior and additional properties of these two families are also studied in detail.

1. Introduction

In fuzzy logic, fuzzy implication functions play a key role as operators that generalize the classical implications in crisp logic. They are functions I : [ 0 , 1 ] 2 [ 0 , 1 ] fulfilling some boundary properties in order to coincide with the classical implication in { 0 , 1 } 2 and some monotonicity properties. These operators are important for both theory and applications. For instance, in the same way classical implications are used in inference schemas such as modus ponens, modus tollens, etc., fuzzy implication functions play a similar role in the generalization of these schemas, which use fuzzy statements whose value is in [0, 1] instead of being in { 0 , 1 } . In addition, fuzzy implication functions also play a different role in other applications such as fuzzy mathematical morphology, fuzzy control or data analysis [1]. Depending on the context and the proper rule and its behavior, various fuzzy implication functions with different properties can be adequate. This fact has motivated the study and definition of many families of fuzzy implication functions, and more than 100 families have been defined until now. For further information, consult the surveys [1,2,3] and the books [4,5].
Although apparently there is a huge amount of fuzzy implication functions available, these families can present intersection or even coincide with others already known [6]. For this reason, it is of the utmost importance to study the additional properties that the operators of certain families satisfy and to provide an axiomatic characterization of the new operators in the literature in order to find its possible relation with respect to those already known. In this respect, the characterization of several families of fuzzy implication functions have already been achieved: ( S , N ) -implications with a continuous negation [7], R-implications obtained from left-continuous t-norms [5,8,9], some Q L -implications [10], Yager’s implications [11], h-implications [12], probabilistic and survival S-implications [6]; among others [13,14].
In this paper, we are interested in the study of the family of ( h , e ) -implications. These fuzzy implication functions were defined for the first time in [15] under the motivation of generalizing h-implications to a new family of functions satisfying the property I ( e , y ) = y for all y [ 0 , 1 ] and some e ( 0 , 1 ) . The family of ( h , e ) -implications has presented very interesting properties such as the controlled increase in the second variable by the parameter e or that they constitute a whole family of fuzzy implication functions fulfilling the exchange principle, but not the law of importation for any t-norm T [16]. Additionally, they have been applied on image processing for edge detection (see [17]), obtaining good results with respect to other families of fuzzy implication functions. Although the properties of ( h , e ) -implications were analyzed for the first time in [15], in [18] it was pointed out that a more general definition was possible. Therefore, our first contribution is to adapt all the existing results to this more general definition and to provide all the proofs.
In [12], it was proved that h-implications were characterized by the fact that their structure is determined by two Yager’s implications through the threshold horizontal method [12], more specifically, the structure of an h-implication is like an adequately scaled f-implication whenever y e and like an adequately scaled g-implication whenever y > e . In this paper, as a second and main contribution, we provide a similar result for ( h , e ) -implications but, in our case, the structure of ( h , e ) -implications is described in terms of two new families of fuzzy implication functions that are generalizations of Yager’s implications, called ( f , g ) and ( g , f ) -implications [19].
To date, there have been several proposals of generalizations of Yager’s implications by considering different approaches: generalizing the inner factors x and 1 x , in the expression of f- and g-generated implications, respectively, [19,20,21,22], considering a different internal function from the product [23,24,25]; among others [26,27]. The families of ( f , g ) and ( g , f ) -implications are of the first kind since they consider the internal factor x as a continuous and strictly decreasing function g : [ 0 , 1 ] [ 0 , + ] with g ( 0 ) = 0 and 1 x as a strictly decreasing function f : [ 0 , 1 ] [ 0 , + ] with f ( 0 ) = + . This approach is different from all the other generalization proposals, and then the interest in these two families is twofold: to describe the structure of ( h , e ) -implications and to study these families in order to compare its properties with other generalizations considered in the literature. Although these two families were preliminary studied in [19], the results were provided without any proof and some of them were partially erroneous. Our third contribution is to provide the proofs of all the results and to rectify the mistakes in some statements.
The paper is structured as follows. In Section 2, we list essential results on fuzzy implication functions. In Section 3, the family of generalized ( h , e ) -implications and its main properties are recalled, and a proof of the representation theorem is given. In Section 4, the families of ( f , g ) and ( g , f ) -implications are presented and their properties are studied. Finally, in Section 5, we gather concluding remarks and we outline some future work.

2. Preliminaries

In this section, we recollect some concepts and results that are useful throughout the paper. First, we recall the definition of fuzzy negation, t-norm and t-conorm, which are generalizations of the classical negation, conjunction and disjunction, respectively, to fuzzy logic.
Definition 1
([8]). A decreasing function N : [ 0 , 1 ] [ 0 , 1 ] is called a fuzzy negation if N ( 0 ) = 1 and N ( 1 ) = 0 .
Definition 2
([28]). A triangular norm or t-norm is a binary function T : [ 0 , 1 ] 2 [ 0 , 1 ] that is commutative, associative, increasing in both variables and 1 is its neutral element. A triangular conorm or t-conorm is a binary function S : [ 0 , 1 ] 2 [ 0 , 1 ] that is commutative, associative, increasing in both variables and 0 is its neutral element.
Next, we introduce the definition of fuzzy implication function.
Definition 3
([5,8]). A binary operator I : [ 0 , 1 ] 2 [ 0 , 1 ] is said to be afuzzy implication functionif it satisfies:
(I1)
I ( x , z ) I ( y , z ) when x y , for all z [ 0 , 1 ] .
(I2)
I ( x , y ) I ( x , z ) when y z , for all x [ 0 , 1 ] .
(I3)
I ( 0 , 0 ) = I ( 1 , 1 ) = 1 and I ( 1 , 0 ) = 0 .
From this definition, it is straightforward to prove that a fuzzy implication function is such that I ( x , 1 ) = 1 and I ( 0 , x ) = 1 for all x [ 0 , 1 ] . However, the 0-horizontal section I ( x , 0 ) and 1-vertical section I ( 1 , x ) for x ( 0 , 1 ) cannot be deduced from the definition.
Since the definition of fuzzy implication function is rather general, additional properties on these operators are considered. Although there exist many additional properties, we recall here the ones that have been more studied.
  • The identity principle
    ( IP ) I ( x , x ) = 1 , x [ 0 , 1 ] .
  • The ordering property
    ( OP ) I ( x , y ) = 1 x y , x , y [ 0 , 1 ] .
  • The exchange principle
    ( EP ) I ( x , I ( y , z ) ) = I ( y , I ( x , z ) ) , x , y , z [ 0 , 1 ] .
  • The law of importation with respect to a t-norm T
    ( LI T ) I ( T ( x , y ) , z ) = I ( x , I ( y , z ) ) , x , y , z [ 0 , 1 ] .
  • The left neutrality principle
    ( NP ) I ( 1 , y ) = y , y [ 0 , 1 ] .
  • The left neutrality principle with e ( 0 , 1 )
    ( NP e ) I ( e , y ) = y , y [ 0 , 1 ] .
  • The contrapositive symmetry with respect to a fuzzy negation N,
    ( CP ( N ) ) I ( x , y ) = I ( N ( y ) , N ( x ) ) , x , y [ 0 , 1 ] .
From the values I ( x , 0 ) of a fuzzy implication function I, we obtain a fuzzy negation called the natural negation of I.
Definition 4
([5]). Let I be a fuzzy implication function. The function N I defined by N I ( x ) = I ( x , 0 ) for all x [ 0 , 1 ] is called the natural negation of I.
The wide definition of fuzzy implication function allows the existence of many families with different additional properties. Depending on the construction method of a family, we can distinguish between three classes: those obtained by the combination of other logical operators such as fuzzy negations, t-norms or t-conorms; those generated by univaluated functions in the interval [0, 1]; and those generated from other fuzzy implication functions. In [29], the reader can find an overview of construction methods of fuzzy implication functions.
Among those fuzzy implication functions whose definition is based on the use generator functions, we can highlight Yager’s implications, called f and g-generated implications. These fuzzy implication functions are generated from additive generators of continuous Archimedean t-norms and t-conorms, respectively.
Definition 5
([5], Definition 3.1.1). Let f : [ 0 , 1 ] [ 0 , + ] be a strictly decreasing and continuous function with f ( 1 ) = 0 . The function I f : [ 0 , 1 ] 2 [ 0 , 1 ] defined by
I f ( x , y ) = f 1 ( x · f ( y ) ) , x , y [ 0 , 1 ] ,
with the understanding 0 · ( + ) = 0 , is called an f-generated implication. The function f itself is called an f-generator.
Definition 6
([5], Definition 3.2.3). Let g : [ 0 , 1 ] [ 0 , + ] be a strictly increasing and continuous function with g ( 0 ) = 0 . The function I g : [ 0 , 1 ] 2 [ 0 , 1 ] defined by
I g ( x , y ) = g ( 1 ) 1 x g ( y ) , x , y [ 0 , 1 ] ,
with the understanding 1 0 = + and + · 0 = + is called a g-generated implication, where the function g ( 1 ) is the pseudo-inverse of g given by
g ( 1 ) ( x ) = g 1 ( x ) i f x [ 0 , g ( 1 ) ] , 1 i f x [ g ( 1 ) , + ] .
In this case, g is called the g-generator of the fuzzy implication function I defined as above.
Another family of fuzzy implication functions of this kind is the h-implications, introduced in [15] following the idea behind the definition of Yager’s implications, but considering additive generators of representable uninorms.
Definition 7
([15], Definition 7). Fix an e ( 0 , 1 ) and let h : [ 0 , 1 ] [ , + ] be a strictly increasing and continuous function with h ( 0 ) = , h ( e ) = 0 and h ( 1 ) = + . The function I h : [ 0 , 1 ] 2 [ 0 , 1 ] defined by
I h ( x , y ) = 1 i f x = 0 , h 1 ( x · h ( y ) ) i f x > 0 and y e , h 1 ( 1 x · h ( y ) ) i f x > 0 and y > e .
is called an h-implication. The function h itself is called an h-generator (with respect to e) of the fuzzy implication function I h defined as above.
These three families of fuzzy implication functions were characterized in [11,12]. Moreover, it was proved that the characterization of h-implications could be derived from the characterization of Yager’s implications since the structure of an h-implication is given by an f and a g-generated implication through the horizontal threshold generation method. The horizontal threshold generation method is a construction method that generates a fuzzy implication function from two given ones and it consists in an appropriate scaling of the second variable of the two fuzzy implication functions.
Theorem 1
([12], Theorem 3). Let I 1 , I 2 be two fuzzy implication functions and e ( 0 , 1 ) . Then, the binary function I I 1 I 2 : [ 0 , 1 ] 2 [ 0 , 1 ] , called the e-horizontal threshold generated implication from I 1 and I 2 , defined as
I I 1 I 2 ( x , y ) = 1 i f x = 0 , e · I 1 x , y e i f x > 0 and y e , e + ( 1 e ) · I 2 x , y e 1 e i f x > 0 and y > e ,
is a fuzzy implication function.

3. Generalized ( h , e ) -Implications

In [15], a new class of fuzzy implications was presented, the family of ( h , e ) -implications. The motivation behind its definition was modifying the h-implications towards fulfilling the property ( NP e ) . Indeed, the family of h-implications presented an unexpected behavior. Most of the families of fuzzy implication functions generated from uninorms such as RU-implications [30], which are generalizations of R-implications, tend to satisfy ( NP e ) instead of ( NP ) . Being h-generators the additive generators of representable uninorms, it would be expected that this family of fuzzy implications functions would satisfy ( NP e ) instead of ( NP ) . This is achieved with a slight modification in the definition leading to the so-called ( h , e ) -implications.
Although ( h , e ) -implications were first defined in [15], in [18] it was pointed out that a more general definition was possible. The latter is the one we recall here.
Definition 8
([18], Definition 11). Fix an e ( 0 , 1 ) and let h : [ 0 , 1 ] [ , + ] be a strictly increasing and continuous function with h ( e ) = 0 and h ( 1 ) = + . The function I h g , e : [ 0 , 1 ] 2 [ 0 , 1 ] defined by
I h g , e ( x , y ) = 1 i f x = 0 , h ( 1 ) x e h ( y ) i f x > 0 , y e , h 1 e x h ( y ) i f x > 0 , y > e ,
where the function h ( 1 ) is the pseudo-inverse of h given by
h ( 1 ) ( x ) = h 1 ( x ) i f x [ h ( 0 ) , + ) , 0 i f x ( , h ( 0 ) ) ,
is called a generalized ( h , e ) -implication. The function h itself is called a generalized h-generator (with respect to e) of the implication function I h g , e defined as above.
Although the above definition was proposed in [18] and the properties that were already studied for ( h , e ) -implications in [15] were reconsidered for this more general definition, the results in [18] were announced without any proof. Therefore, hereafter we recall those results, but provide the corresponding proof. Having said this, the next proposition ensures that generalized ( h , e ) -implications are indeed fuzzy implication functions.
Proposition 1
([18], Proposition 9). If h is a generalized h-generator with respect to a fixed e ( 0 , 1 ) , then I h g , e is a fuzzy implication function.
Proof. 
-
Let x 1 , x 2 , y [ 0 , 1 ] with x 1 < x 2 . Since h is strictly increasing, we have h ( x 1 ) < h ( x 2 ) and it holds that h ( 1 ) is an increasing function. Now, we have to distinguish three cases:
-
If x 1 = 0 then I h g , e ( 0 , y ) = 1 I h g , e ( x 2 , y ) .
-
If x 1 0 and y e then h ( y ) 0 and x 1 e h ( y ) x 2 e h ( y ) . Consequently,
I h g , e ( x 1 , y ) = h ( 1 ) x 1 e h ( y ) h ( 1 ) x 2 e h ( y ) = I h g , e ( x 2 , y ) .
-
If x 1 0 and y > e then h ( y ) > 0 and e x 1 h ( y ) > e x 2 h ( y ) . Therefore,
I h g , e ( x 1 , y ) = h ( 1 ) e x 1 h ( y ) h ( 1 ) e x 2 h ( y ) = I h g , e ( x 2 , y ) .
-
Let x , y 1 , y 2 [ 0 , 1 ] with y 1 < y 2 . Then, similarly to the previous item, we have h ( y 1 ) < h ( y 2 ) and we have to consider four different cases:
-
If x = 0 then I h g , e ( 0 , y 1 ) = 1 = I h g , e ( 0 , y 2 ) .
-
If x 0 and y 1 < y 2 e we have that h ( y 1 ) < h ( y 2 ) h ( e ) = 0 and
I h g , e ( x , y 1 ) = h ( 1 ) x e h ( y 1 ) h ( 1 ) x e h ( y 2 ) = I h g , e ( x , y 1 ) .
-
If x 0 and y 1 e < y 2 , we have that h ( y 1 ) 0 < h ( y 2 ) so x e h ( y 1 ) 0 < e x h ( y 2 ) and we get that
I h g , e ( x , y 1 ) = h ( 1 ) x e h ( y 1 ) h ( 1 ) ( 0 ) = e < h 1 e x h ( y 2 ) = I h g , e ( x , y 2 ) .
-
If x 0 and e < y 1 < y 2 then we have that 0 < h ( y 1 ) < h ( y 2 ) . Thus,
I h g , e ( x , y 1 ) = h 1 e x h ( y 1 ) h 1 e x h ( y 2 ) = I h g , e ( x , y 2 ) .
-
Finally, I h g , e satisfies the boundary conditions since
-
I h g , e ( 0 , 0 ) = 1 by construction.
-
I h g , e ( 1 , 1 ) = h 1 1 e h ( 1 ) = h 1 ( + ) = 1 .
-
I h g , e ( 1 , 0 ) = h ( 1 ) 1 e h ( 0 ) = 0 .
Moreover, like in the case of h-implications, the generator of a generalized ( h , e ) -implication is unique up to a positive multiplicative constant piecewise.
Proposition 2
([18], Proposition 10). Let h 1 , h 2 : [ 0 , 1 ] [ , + ] be two generalized h-generators with respect to a fixed e ( 0 , 1 ) . Then, the following statements are equivalent:
(i)
I h 1 , g , e = I h 2 , g , e .
(ii)
There exist constants k , c ( 0 , + ) such that
h 2 ( x ) = k · h 1 ( x ) i f x [ 0 , e ) , c · h 1 ( x ) i f x [ e , 1 ] .
Proof. 
The proof is identical to the proof of Theorem 17 in [15]. □
Hereunder, we recall some of the basic properties of generalized ( h , e ) -implications. First of all, the next result studies the natural negation. Notice that in contrast with ( h , e ) -implications, the presence of h ( 1 ) in the more general definition implies that the behavior of the natural negation depends on the value of h in zero.
Proposition 3
([18], Proposition 11). Let h be a generalized h-generator. Then,
-
If h ( 0 ) = , then the natural negation N I h g , e is the Gödel negation or least negation N D 1 , given by
N D 1 ( x ) = 1 i f x = 0 , 0 otherwise .
-
If h ( 0 ) > , then the natural negation N I h g , e is given by
N I h g , e ( x ) = I h g , e ( x , 0 ) = 1 i f x = 0 , h 1 x e h ( 0 ) i f x e , 0 i f x > e .
Proof. 
Let h be a generalized h-generator. Then,
-
If h ( 0 ) = , then h ( 1 ) = h 1 and for every x [ 0 , 1 ] we get
N I h g , e ( x ) = I h g , e ( x , 0 ) = 1 if x = 0 , h 1 if x ( 0 , 1 ] , = 1 if x = 0 , 0 if x ( 0 , 1 ] .
-
If h ( 0 ) > then we have
N I h g , e ( x ) = I h g , e ( x , 0 ) = 1 if x = 0 , h 1 x e h ( 0 ) if x e h ( 0 ) h ( 0 ) , 0 if x e h ( 0 ) < h ( 0 ) , = 1 if x = 0 , h 1 x e h ( 0 ) if x e , 0 if x > e .
The following proposition studies when generalized ( h , e ) -implications fulfill the additional properties of fuzzy implication functions considered in this paper.
Theorem 2
([18], Theorem 22). Let h be a generalized h-generator and e ( 0 , 1 ) . The following properties hold:
(i)
I h g , e ( x , y ) e if and only if ( x > 0 and y e ) . Moreover, I h g , e ( x , e ) = e for all x > 0 .
(ii)
I h g , e satisfies(EP)if and only if h ( 0 ) = .
(iii)
I h g , e ( x , y ) = 1 if and only if x = 0 or y = 1 . Thus, I h g , e does not satisfy either(OP)or(IP).
(iv)
I h g , e is continuous, except at the points ( 0 , y ) with y e .
(v)
I h g , e satisfies ( NP e ) , but does not satisfy(NP).
(vi)
I h g , e does not satisfy ( LI T ) with respect to any t-norm T.
(vii)
I h g , e does not satisfy (CP(N)) with any fuzzy negation N.
Proof. 
(i)
It is clear that if x > 0 and y e , then I h g , e ( x , y ) = h ( 1 ) x e h ( y ) e since h ( y ) 0 . Otherwise, if x = 0 , I h g , e ( 0 , y ) = 1 for all y [ 0 , 1 ] and if x > 0 and y > e , I h g , e ( x , y ) = h 1 e x h ( y ) > e because h ( y ) > 0 . Moreover, we have that I h g , e ( x , e ) = h ( 1 ) x e h ( e ) = h ( 1 ) ( 0 ) = e for all x > 0 .
(ii)
Assume that I h g , e satisfies (EP). Now, let us consider h ( 0 ) > and we will get a contradiction. On the one hand, if 0 < x 0 < e 2 , we have
I h g , e ( x 0 , I h g , e ( 1 , 0 ) ) = I h g , e ( x 0 , 0 ) = h ( 1 ) x 0 e h ( 0 ) = h 1 x 0 e h ( 0 ) .
On the other hand, let us compute I h g , e ( 1 , I h g , e ( x 0 , 0 ) ) . First, we have
x 0 < e x 0 e h ( 0 ) > h ( 0 ) I h g , e ( x 0 , 0 ) = h 1 x 0 e h ( 0 ) .
Now, since x 0 < e 2 and by item (i) I h g , e ( x 0 , 0 ) e we get that
I h g , e ( 1 , I h g , e ( x 0 , 0 ) ) = I h g , e 1 , h 1 x 0 e h ( 0 ) = h ( 1 ) x 0 e 2 h ( 0 ) = h 1 x 0 e 2 h ( 0 ) .
Since we have that h 1 is strictly increasing in [ h ( 0 ) , + ] , we get
h 1 x 0 e 2 h ( 0 ) < h 1 x 0 e h ( 0 ) .
Hence, I h g , e ( 1 , I h g , e ( x 0 , 0 ) ) < I h g , e ( x 0 , I h g , e ( 1 , 0 ) ) , in contradiction with the fact that I h g , e satisfies (EP).
For the reverse implication, if h ( 0 ) = , we know that in this case h ( 1 ) = h 1 and N I h g , e = N D 1 . For any x , y , z [ 0 , 1 ] , let us distinguish five cases:
-
If x = 0 , then for all y , z [ 0 , 1 ] we have
I h g , e ( 0 , I h g , e ( y , z ) ) = 1 = I h g , e ( y , 1 ) = I h g , e ( y , I h g , e ( 0 , z ) ) .
-
If y = 0 for all x , z [ 0 , 1 ] we have
I h g , e ( x , I h g , e ( 0 , z ) ) = I h g , e ( x , 1 ) = 1 = I h g , e ( 0 , I h g , e ( x , z ) ) .
-
If x 0 , y 0 and z = 0 , we obtain
I h g , e ( x , I h g , e ( y , 0 ) ) = I h g , e ( x , N I h g , e ( y ) ) = I h g , e ( x , 0 ) = N I h g , e ( x ) = 0 = N I h g , e ( y ) = I h g , e ( y , 0 ) = I h g , e ( y , N I h g , e ( x ) ) = I h g , e ( y , I h g , e ( x , 0 ) ) .
-
If x 0 , y 0 and z e , by the item (i), I h g , e ( y , z ) e and I h g , e ( x , z ) e and consequently
I h g , e ( x , I h g , e ( y , z ) ) = I h g , e x , h 1 y e h ( z ) = h 1 x y e 2 h ( z ) .
Similarly,
I h g , e ( y , I h g , e ( x , z ) ) = I h g , e y , h 1 x e h ( z ) = h 1 x y e 2 h ( z ) .
-
Finally, if x 0 , y 0 and e < z 1 , then again by (i) we have I h g , e ( y , z ) > e and I h g , e ( x , z ) > e and thus
I h g , e ( x , I h g , e ( y , z ) ) = I h g , e x , h 1 e y h ( z ) = h 1 e 2 x y h ( z ) ,
I h g , e ( y , I h g , e ( x , z ) ) = I h g , e y , h 1 e x h ( z ) = h 1 e 2 x y h ( z ) .
(iii)
It is obvious that if x = 0 or y = 1 , I h g , e ( x , y ) = 1 since I h g , e is a fuzzy implication function. If y e , by item (i), I h g , e ( x , y ) e < 1 and if e < y < 1 , 0 < h ( y ) < + and we have
I h g , e ( x , y ) = h 1 e x h ( y ) < h 1 ( + ) = 1 .
(iv)
By definition, the implication I h g , e is continuous for all ( x , y ) ( 0 , 1 ] × [ 0 , e ) and for all ( x , y ) ( 0 , 1 ] × ( e , 1 ] . Further, the vertical sections with a fixed x > 0 are continuous since
I h g , e ( x , e ) = h ( 1 ) x e h ( e ) = h ( 1 ) ( 0 ) = e ,
and
lim y e I h g , e ( x , y ) = lim y e h ( 1 ) x e h ( y ) = h ( 1 ) ( 0 ) = e ,
lim y e + I h g , e ( x , y ) = lim y e + h 1 e x h ( y ) = h 1 ( 0 ) = e .
On the other hand, the horizontal sections with y > e are continuous since I h g , e ( 0 , y ) = 1 and
lim x 0 + I h g , e ( x , y ) = lim x 0 + h 1 e x h ( y ) = h 1 ( + ) = 1 .
However, fixed 0 < y e , < h ( y ) 0 and we know that I h g , e ( 0 , y ) = 1 , but
lim x 0 + I h g , e ( x , y ) = lim x 0 + h ( 1 ) x e h ( y ) = h ( 1 ) ( 0 ) = e ,
thus I h g , e horizontal sections with y e are continuous except at the points ( 0 , y ) with 0 < y e . Finally, by Proposition 3, I h g , e is also not continuous at the point ( 0 , 0 ) . Now, applying ([5] Theorem A.0.4) adequately, we can prove that I h g , e is continuous, except at the points ( 0 , y ) with y e .
(v)
For all y [ 0 , 1 ] we have that
I h g , e ( e , y ) = h ( 1 ) h ( y ) if y e , h 1 h ( y ) if y > e , = y .
Thus, I h g , e satisfies ( NP e ) . On the other hand, for all y > e , we have
I h g , e ( 1 , y ) = y h 1 ( e h ( y ) ) = y e h ( y ) = h ( y ) e = 1 .
Thus, I h g , e does not satisfy (NP).
(vi)
Suppose that I h g , e fulfills ( LI T ) with respect to a t-norm T, then we know that it also fulfills (EP), and by item (ii), h ( 0 ) = . Now, taking x = y = 1 and e < z < 1 , since T ( 1 , 1 ) = 1 we find that
I h g , e ( T ( 1 , 1 ) , z ) = I h g , e ( 1 , I h g , e ( 1 , z ) ) h 1 ( e h ( z ) ) = h 1 ( e 2 h ( z ) ) e = 1 .
Thus, I h g , e does not satisfy ( LI T ) with respect to any t-norm T.
(vii)
Suppose that I h g , e satisfies (CP(N)) with a fuzzy negation N. So, we have I h g , e ( x , y ) = I h g , e ( N ( y ) , N ( x ) ) for all x , y [ 0 , 1 ] . Taking x = 1 and y = e , we know by item (i) that I h g , e ( 1 , e ) = e and then
e = I h g , e ( 1 , e ) = I h g , e ( N ( e ) , N ( 1 ) ) = I h g , e ( N ( e ) , 0 ) = N I h g , e N ( e ) .
If h ( 0 ) = then N I h g , e = N D 1 and we obtain a contradiction. If h ( 0 ) > then
e = N I h g , e N ( e ) = 1 if N ( e ) = 0 h 1 N ( e ) e h ( 0 ) if N ( e ) e , 0 if N ( e ) > e ,
and the only feasible case is N ( e ) ( 0 , e ] and then N ( e ) h ( 0 ) = h ( e ) · e = 0 , which is also a contradiction.
Perhaps one of the main properties of ( h , e ) -implications is given by (i) in the previous theorem. It reflects that these operators have a controlled increase with respect to the second variable produced by the insertion of the parameter e, as we can graphically see in Figure 1. Observe that the fuzzy implication functions generated by the horizontal threshold method in Theorem 1 had a similar property, so it is intuitive to think that generalized ( h , e ) -implications are related in some way with this method. Furthermore, notice that the family of generalized ( h , e ) -implications provides an example of fuzzy implication functions that do not satisfy ( LI T ) with respect to any t-norm T and yet satisfy (EP) when h ( 0 ) = , providing another argument of the fact that ( LI T ) is stronger than (EP) [16].
Example 1.
Let us consider the generalized h-generator
h ( x ) = ln x e i f x e , ln 1 x 1 e i f x > e ,
with e ( 0 , 1 ) . The corresponding ( h , e ) -implication is the following one
I h 1 , e ( x , y ) = 1 i f x = 0 , e y e x e i f x > 0 , y e , 1 ( 1 e ) · 1 y 1 e e x i f x > 0 , y > e .
The plot of this ( h , e ) -implication for different values of the parameter e can be seen in Figure 1.
Figure 1. Plot of the ( h , e ) -implication given by Equation (1) for different values of e. (a) e = 0.25, (b) e = 0.5, (c) e = 0.75.
Figure 1. Plot of the ( h , e ) -implication given by Equation (1) for different values of e. (a) e = 0.25, (b) e = 0.5, (c) e = 0.75.
Mathematics 09 01490 g001

Representation Theorem

Although there is no axiomatic characterization of ( h , e ) -implications, in [19] a representation theorem for this family was presented without the corresponding proof. In this article, we provide a proof to that result and we adjust it to the case of generalized ( h , e ) -implications.
Theorem 3.
Let I : [ 0 , 1 ] 2 [ 0 , 1 ] be a binary function and e ( 0 , 1 ) . Then, I is a generalized ( h , e ) -implication with respect to e if and only if there exist an f-generator and a g-generator with g ( 1 ) = + such that I is given by
I ( x , y ) = 1 i f x = 0 , e · f ( 1 ) x e · f y e i f x > 0 , y e , e + ( 1 e ) · g 1 e x · g y e 1 e i f x > 0 , y > e .
Moreover, in this case generators h, f and g are related in the following way:
f ( x ) = h ( e · x ) for all x [ 0 , 1 ] ,
g ( x ) = h ( e + ( 1 e ) · x ) for all x [ 0 , 1 ] ,
h ( x ) = f x e if x e , g x e 1 e if x > e .
Proof. 
Let I be a generalized ( h , e ) -implication with respect to e. We know that h is a continuous and strictly increasing function with h ( e ) = 0 and h ( 1 ) = + . First of all, note that f ( x ) = h ( e x ) and g ( x ) = h ( e + ( 1 e ) x ) are f and g-generators, respectively, since f is a continuous and strictly decreasing function with f ( 1 ) = h ( e ) = 0 and g is a continuous and strictly increasing function with g ( 0 ) = h ( e ) = 0 . Note that since h 1 is well-defined on [ h ( 0 ) , + ) with h ( 0 ) < 0 then we have for all x [ 0 , + ) that
f ( 1 ) ( x ) = h ( 1 ) ( x ) e , g 1 ( x ) = h 1 ( x ) e 1 e .
We will split the proof in two cases:
-
If x > 0 and y e , then
e f ( 1 ) x e f y e = e f ( 1 ) x e h ( y ) = h ( 1 ) x e h ( y ) = I ( x , y ) .
-
If x > 0 and y > e then
e + ( 1 e ) · g 1 e x g y e 1 e = e + ( 1 e ) · h 1 e x h e + ( 1 e ) y e 1 e e 1 e = h 1 e x h ( y ) = I ( x , y ) .
For the reverse implication, let us consider f and g-generators such that I is given by Equation (2). Consider
h ( x ) = f x e if x e , g x e 1 e if x > e .
This function is continuous, strictly increasing, h ( e ) = f ( 1 ) = 0 and h ( 1 ) = g ( 1 ) = + . Now, let us prove that I = I h g , e . Notice that
h ( 1 ) ( x ) = h 1 ( x ) if x [ h ( 0 ) , + ) , 0 if x ( , h ( 0 ) ) , = 0 if x ( , f ( 0 ) ) , e · f 1 ( x ) if x [ f ( 0 ) , 0 ] , e + ( 1 e ) · g 1 ( x ) if x ( 0 , + ) .
Then, studying again two cases we have that
-
If x > 0 and y e then
I h g , e ( x , y ) = h ( 1 ) x e h ( y ) = h ( 1 ) x e f y e = e · f ( 1 ) x e f y e = I ( x , y ) .
-
If x > 0 and y > e then
I h g , e ( x , y ) = h 1 e x h ( y ) = h 1 e x g y e 1 e = e + ( 1 e ) · g 1 e x g y e 1 e = I ( x , y ) .
The next example provides the construction of an ( h , e ) -implication by using the threshold horizontal method given an f-generator and g-generator with g ( 1 ) = + .
Example 2.
Take, for instance, e = 1 2 and the subsequent f and g-generators
f ( x ) = ln x 2 x , g ( x ) = ln 1 + x 1 x .
Then, it is easy to check that the following functions are fuzzy implication functions
I 1 ( x , y ) = f ( 1 ) x e f ( y ) = 2 y 2 x ( 2 y ) 2 x + y 2 x ,
I 2 ( x , y ) = g 1 e x g ( y ) = ( 1 + y ) 1 2 x ( 1 y ) 1 2 x ( 1 + y ) 1 2 x + ( 1 y ) 1 2 x .
Then, an ( h , e ) -implication is constructed from I 1 and I 2 by using the threshold horizontal method as Theorem 3 shows. Concretely, the h-generator corresponds to
h ( x ) = ln x 1 x .
We can see the construction method graphically in Figure 2.
Although Theorem 3 gives a useful description of the family of generalized ( h , e ) -implications, it is not an axiomatic characterization of this family, i.e., a characterization in terms of their own properties. For providing such results, a deeper study of this family is needed.
Let us recall that the characterization of h-implications presented in [12] was written in terms of the threshold horizontal method, in particular h-implications are characterized by the fact that they are generated by an f-implication and a g-implication through the horizontal threshold method. In this case, the axiomatic characterization was not provided, but it can be easily obtained by using the characterizations of Yager’s implications presented in [11]. For the case of generalized ( h , e ) -implications, it is straightforward to prove that if we consider an f-generator, the function I f , e : [ 0 , 1 ] 2 [ 0 , 1 ] defined by
I f , e ( x , y ) = f ( 1 ) x e f ( y ) , x , y [ 0 , 1 ] ,
with the understanding + · 0 = 0 is a fuzzy implication function and if we consider a g-generator with g ( 1 ) = + , the function I g , e : [ 0 , 1 ] 2 [ 0 , 1 ] defined by
I g , e ( x , y ) = g ( 1 ) e x g ( y ) , x , y [ 0 , 1 ] ,
with the understanding 1 0 = + and + · 0 = + is also a fuzzy implication function. Notice that Theorem 3 discloses that generalized ( h , e ) -implications are also characterized by the fact that they can be generated through the horizontal threshold method by the two new families of fuzzy implication functions just introduced. Therefore, in order to obtain a characterization of ( h , e ) -implications, we have to study and characterize the two families of fuzzy implication functions defined.
In particular, I f , e and I g , e are fuzzy implication functions that belong to two families which are generalizations of the well-known Yager’s implications. In the next section, we deeply study these two families.

4. Generalized Yager’s Implications

In [19], two new families of fuzzy implication functions, called the ( f , g ) and ( g , f ) -generated implications, were defined as a generalization of the well-known Yager’s f and g-generated implications, respectively. In the definition of the f-generated implications, one can consider the function x as a particular case of a family of strictly increasing and continuous functions defined as g : [ 0 , 1 ] [ 0 , + ] such that g ( 0 ) = 0 . The same happens to the role of 1 x as a concrete case of a continuous, strictly decreasing function f : [ 0 , 1 ] [ 0 , + ] such that f ( 0 ) = + . In this section, we recall the definitions and properties of these two families of fuzzy implication functions published in [19], providing the corresponding proofs and rectifying some wrongly stated results.

4.1. Generalization of f-Generated Implications

First, we will study a generalization of the f-generated implications, generalizing the function x in its definition as a strictly increasing function g : [ 0 , 1 ] [ 0 , + ] with g ( 0 ) = 0 .
Definition 9.
Let f : [ 0 , 1 ] [ 0 , + ] be a strictly decreasing and continuous function with f ( 1 ) = 0 and g : [ 0 , 1 ] [ 0 , + ] be a continuous and strictly increasing function with g ( 0 ) = 0 . The function I f , g : [ 0 , 1 ] 2 [ 0 , 1 ] defined by
I f , g ( x , y ) = f ( 1 ) ( g ( x ) f ( y ) ) , x , y [ 0 , 1 ] ,
with the understanding 0 · ( + ) = 0 , is called an ( f , g ) -generated operation.
Remark 1.
An initial difference between the family of f-generated implications and its generalization is that we need to consider the pseudo-inverse of f. This is because when f ( 0 ) < + , g ( x ) · f ( y ) may be bigger than the initial value f ( 0 ) . Nevertheless, notice that Equation (3) can also be written in the following form without explicitly using the pseudo-inverse of f:
I ( x , y ) = f 1 min f ( x ) g ( y ) , f ( 0 ) , x , y [ 0 , 1 ] .
An ( f , g ) -generated operation may not fulfill all the conditions in Definition 3, and then it is not always a fuzzy implication function.
Theorem 4.
An ( f , g ) -operation I f , g is a fuzzy implication function if and only if one of the following conditions hold:
(i)
f ( 0 ) = + .
(ii)
f ( 0 ) < + and g ( 1 ) 1 .
Proof. 
First, we will consider that I f , g is a fuzzy implication function with f ( 0 ) < + . In this case,
I f , g ( 1 , 0 ) = f ( 1 ) ( g ( 1 ) f ( 0 ) ) = f 1 ( g ( 1 ) f ( 0 ) ) if g ( 1 ) < 1 , 0 if g ( 1 ) 1 .
Since I f , g is a fuzzy implication function, then it holds that I f , g ( 1 , 0 ) = 0 and hence, g ( 1 ) 1 .
Now, let us consider an ( f , g ) -operation satisfying (i) or (ii). The fact that I f , g is a fuzzy implication function can be seen from the following:
-
Let x 1 , x 2 , y [ 0 , 1 ] with x 1 x 2 . Since g is strictly increasing, we have that g ( x 1 ) g ( x 2 ) . Now, since f is strictly decreasing, f ( 1 ) is decreasing, and we find that
I f , g ( x 1 , y ) = f ( 1 ) ( g ( x 1 ) f ( y ) ) f ( 1 ) ( g ( x 2 ) f ( y ) ) = I f , g ( x 2 , y ) ,
and I f , g satisfies (I1).
-
Consider x , y 1 , y 2 [ 0 , 1 ] with y 1 y 2 then, again by the strictly decreasing nature of f, f ( 1 ) is decreasing, and hence, we have
f ( y 1 ) f ( y 2 ) g ( x ) · f ( y 1 ) g ( x ) · f ( y 2 ) f ( 1 ) ( g ( x ) · f ( y 1 ) ) f ( 1 ) ( g ( x ) · f ( y 2 ) ) I f , g ( x , y 1 ) I f , g ( x , y 2 ) ,
and I f , g satisfies (I2).
-
I f , g ( 0 , 0 ) = f ( 1 ) ( g ( 0 ) f ( 0 ) ) = f ( 1 ) ( 0 ) = 1 .
-
I f , g ( 1 , 1 ) = f ( 1 ) ( g ( 1 ) f ( 1 ) ) = f ( 1 ) ( 0 ) = 1 .
-
I f , g ( 1 , 0 ) = f ( 1 ) ( g ( 1 ) f ( 0 ) ) and we have two cases. If f ( 0 ) = + then I f , g ( 1 , 0 ) = f 1 ( + ) = 0 . Otherwise, if f ( 0 ) < + and g ( 1 ) 1 then, f ( 0 ) g ( 1 ) f ( 0 ) and I f , g ( 1 , 0 ) = 0 .
Remark 2.
In [21], a similar approach to provide a generalization of Yager’s f-implications was considered. In this case, the authors consider the fuzzy implication function given by I f , g ( x , y ) = f ( 1 ) ( g ( x ) f ( y ) ) where f is an f-generator and g : [ 0 , 1 ] [ 0 , 1 ] is an increasing function satisfying g ( 0 ) = 0 and g ( 1 ) = 1 . In this case, they consider functions g, which are not necessarily continuous, but with g ( 1 ) = 1 . Our approach restricts to the case when g is continuous, but allows any value in ( 0 , + ) of g ( 1 ) whenever f ( 0 ) = + and any value g ( 1 ) 1 whenever f ( 0 ) < + . Clearly, the two families intersect when we consider a continuous, strictly decreasing function g with g ( 1 ) = 1 . Moreover, by Remark 2.1 in [21], in this particular case the resulting ( f , g ) -implications are in fact ϕ-conjugated of f-generated implications with f generator given by f g 1 and φ = g .
When an ( f , g ) -operation fulfills Definition 3, we will use the nomenclature ( f , g ) -implication and we will call an admissible pair of generators to the pair of functions ( f , g ) .
The next result shows that it is enough to consider the pairs ( f , g ) of admissible generators such that f ( 0 ) = + or f ( 0 ) = 1 .
Proposition 4.
Let I f , g be a fuzzy implication function with f ( 0 ) < + , then there exists a function f 1 with f 1 ( 0 ) = 1 such that ( f 1 , g ) is an admissible pair of generators and I f , g = I f 1 , g .
Proof. 
Let I f , g be a fuzzy implication function with f ( 0 ) < + and consider f 1 ( x ) = f ( x ) f ( 0 ) . Then, ( f 1 , g ) is an admissible pair of generators with f 1 ( 0 ) = f ( 0 ) f ( 0 ) = 1 and since f 1 1 ( x ) = f 1 ( x f ( 0 ) ) then
I f 1 , g ( x , y ) = f 1 ( 1 ) g ( x ) f 1 ( y ) = f 1 ( 1 ) g ( x ) f ( y ) f ( 0 ) = f 1 1 min g ( x ) f ( y ) f ( 0 ) , f 1 ( 0 ) = f 1 min { g ( x ) f ( y ) , f ( 0 ) } = I f , g ( x , y ) .
Then next proposition shows that the ( f , g ) -generated implications have non-trivial zero region for some choice of generators.
Proposition 5.
Let ( f , g ) be an admissible pair of generators. Then, the following statements hold:
(i)
If g ( 1 ) < f ( 0 ) = + , then I f , g ( x , y ) = 0 if and only if y = 0 < x .
(ii)
If g ( 1 ) = f ( 0 ) = + , then I f , g ( x , y ) = 0 if and only if y < x = 1 or y = 0 < x .
(iii)
If f ( 0 ) < + , then I f , g ( x , y ) = 0 if and only if g ( x ) 1 and y f 1 f ( 0 ) g ( x ) .
Proof. 
(i)
Let us assume that g ( 1 ) < f ( 0 ) = + then f ( 1 ) = f 1 . Hence, for every x , y [ 0 , 1 ] , we find that
I f , g ( x , y ) = f 1 ( g ( x ) f ( y ) ) = 0 g ( x ) f ( y ) = f ( 0 ) = + .
However, we know that g ( x ) g ( 1 ) < + , then the only possibility is f ( y ) = + and g ( x ) 0 . Consequently, y = 0 < x .
(ii)
Again we have that f ( 1 ) = f 1 and then,
I f , g ( x , y ) = 0 g ( x ) f ( y ) = + .
Therefore, g ( x ) = + and f ( y ) > 0 or, g ( x ) > 0 and f ( y ) = + . Hence, the results follows.
(iii)
Consider x , y [ 0 , 1 ] then
I f , g ( x , y ) = 0 f ( 1 ) ( g ( x ) f ( y ) ) = 0 g ( x ) f ( y ) [ f ( 0 ) , + ) .
Now, since f is strictly decreasing, f ( y ) f ( 0 ) for all y [ 0 , 1 ] and then necessarily g ( x ) 1 . Finally,
g ( x ) f ( y ) f ( 0 ) f ( y ) f ( 0 ) g ( x ) y f 1 f ( 0 ) g ( x ) .
On the other hand, the next proposition shows that the region where the ( f , g ) -generated implications take the value 1 is independent of their generators.
Proposition 6.
Let ( f , g ) be an admissible pair of generators. Then I f , g ( x , y ) = 1 if and only if x = 0 or y = 1 .
Proof. 
Let ( f , g ) be an admissible pair of generators and x , y [ 0 , 1 ] . Then,
I f , g ( x , y ) = 1 f ( 1 ) ( g ( x ) f ( y ) ) = 1 g ( x ) f ( y ) = 0 g ( x ) = 0 or f ( y ) = 0 x = 0 or y = 1 .
The determination of the one region obtained in the previous proposition is a property of fuzzy implication functions deeply studied in [31] where it is explained that the property I ( x , y ) = 1 x = 0 or y = 1 is very important for the definition of strong equality indices. Consequently, ( f , g ) -implications could be used to generate strong equality indices. Furthermore, in [11], this property plays a crucial role in the characterization of f-generated implications.
From the previous proposition, the following result is straightforward.
Corollary 1.
Let ( f , g ) be an admissible pair of generators. Then, the ( f , g ) -implication I f , g does not satisfy either(IP)or(OP).
The next proposition studies under which conditions (NP) is satisfied by the ( f , g ) -generated implications. This property is satisfied by many of the most well-known families and therefore, to determine when ( f , g ) -implications fulfill (NP) is a necessary step for forthcoming studies on the intersections of this family with other existing families.
Proposition 7.
Let ( f , g ) be an admissible pair of generators. Then, I f , g satisfies(NP)if and only if g ( 1 ) = 1 .
Proof. 
Consider ( f , g ) an admissible pair of generators. It is clear from the definition of fuzzy implication function that I f , g ( 1 , 0 ) = 0 and I f , g ( 1 , 1 ) = 1 . Otherwise, since f is strictly decreasing and continuous with f ( 1 ) = 0 , we can choose y ( 0 , 1 ) such that g ( 1 ) f ( y ) < f ( 0 ) and then
I f , g ( 1 , y ) = f ( 1 ) ( g ( 1 ) f ( y ) ) = y g ( 1 ) f ( y ) = f ( y ) g ( 1 ) = 1 .
The following result studies the natural negation of these fuzzy implication functions. The properties of the natural negation play an important role in many characterization results of fuzzy implication functions.
Proposition 8.
Let ( f , g ) be an admissible pair of generators. Then, the following properties hold:
(i)
If f ( 0 ) = + , then the natural negation N I f , g is the Gödel or least negation N D 1 .
(ii)
If f ( 0 ) < + , then the natural negation N I f , g is given by
N I f , g ( x , y ) = f 1 ( g ( x ) f ( 0 ) ) if g ( x ) < 1 , 0 if g ( x ) 1 .
(iii)
The natural negation N I f , g is continuous and strictly increasing if and only if f ( 0 ) < + and g ( 1 ) = 1 .
Proof. 
(i)
If f ( 0 ) = + , then f ( 1 ) = f 1 and for every x [ 0 , 1 ] we get
N I f , g ( x ) = f 1 ( g ( x ) f ( 0 ) ) = f 1 ( + ) if g ( x ) 0 , f 1 ( 0 ) if g ( x ) = 0 , = 0 if x > 0 , 1 if x = 0 , = N D 1 ( x ) .
(ii)
If f ( 0 ) < + then we have
N I f , g ( x ) = f ( 1 ) ( g ( x ) f ( 0 ) ) = f 1 ( g ( x ) f ( 0 ) ) if g ( x ) f ( 0 ) < f ( 0 ) , 0 if g ( x ) f ( 0 ) f ( 0 ) , = f 1 ( g ( x ) f ( 0 ) ) if g ( x ) < 1 , 0 if g ( x ) 1 .
(iii)
If f ( 0 ) < + and g ( 1 ) = 1 , it is straightforward from point (ii) that N I f , g is a continuous function since it is the composition of real continuous functions. Consider x 1 < x 2 , by the strictly increasing nature of g, we have that g ( x 1 ) f ( 0 ) < g ( x 2 ) f ( 0 ) . Now, since f is strictly decreasing, f 1 is strictly decreasing in [ 0 , f ( 0 ) ] , and we get that
N I f , g ( x 1 ) = f 1 ( g ( x 1 ) f ( 0 ) ) > f 1 ( g ( x 2 ) f ( 0 ) ) = N I f , g ( x 2 ) .
Hence, N I f , g is strictly decreasing. Reciprocally, items (i) and (ii) prove that the obtained natural negations are not strictly decreasing when f ( 0 ) = + or when f ( 0 ) < + and g ( 1 ) > 1 .
At this point, we analyze the discontinuity points of the ( f , g ) -generated implications, which can be ( 0 , 0 ) or ( 1 , 1 ) .
Proposition 9.
Let ( f , g ) be an admissible pair of generators. Then I f , g is continuous everywhere except at point ( 0 , 0 ) when f ( 0 ) = + or at point ( 1 , 1 ) when g ( 1 ) = + .
Proof. 
Let ( f , g ) be an admissible pair of generators, then by definition I f , g is continuous at each ( x , y ) [ 0 , 1 ] 2 by being the composition of real continuous functions except for the cases when ( g ( x ) = 0 and f ( y ) = + ) or ( g ( x ) = + or f ( y ) =0 ), since in these situations we have considered the convention 0 · ( + ) = 0 . These two situations correspond to the following two cases:
  • If x = y = 0 and f ( 0 ) = + , then because of (i) in Proposition 8, the natural negation of I f , g is not continuous at x = 0 , and therefore I f , g is non-continuous at ( 0 , 0 ) .
  • If x = y = 1 and g ( 1 ) = + , then
    I f , g ( 1 , y ) = f ( 1 ) ( + · f ( y ) ) = f 1 ( 0 ) if y = 1 , 0 if y < 1 , = 1 if y = 1 , 0 if y < 1 .
    Hence, we have that
    lim y 1 I f , g ( 1 , y ) = 0 1 = I f , g ( 1 , 1 ) ,
    and I f , g is not continuous at ( 1 , 1 ) .
Consequently, there are members of the family that are continuous in the whole domain, and therefore, feasible to be applied in several fields.
Finally, we present two results that determine completely when the ( f , g ) -generated implications satisfy (EP) or ( LI T ) .
Proposition 10.
Let ( f , g ) be an admissible pair of generators. Then, the following statements are equivalent:
(i)
I f , g satisfies(EP).
(ii)
f ( 0 ) = + or ( f ( 0 ) < + and g ( 1 ) = 1 ).
Proof. 
Assume that I f , g satisfies (EP). Now, let us consider f ( 0 ) < + and g ( 1 ) > 1 and get a contradiction. On the one hand, we have that
I f , g ( x , I f , g ( 1 , 0 ) ) = I f , g ( x , 0 ) = f ( 1 ) ( g ( x ) f ( 0 ) ) .
Now, since g is strictly increasing and continuous with g ( 0 ) = 0 , we can find some x 0 ( 0 , 1 ) small enough such that
0 < g ( 1 ) g ( x 0 ) < 1 and 0 < g ( x 0 ) < 1 .
Then, I f , g ( x 0 , 0 ) = f 1 ( g ( x 0 ) f ( 0 ) ) and we get that
I f , g ( 1 , I f , g ( x 0 , 0 ) ) = I f , g ( 1 , f 1 ( g ( x 0 ) f ( 0 ) ) ) = f 1 ( g ( 1 ) g ( x 0 ) f ( 0 ) ) .
However, since g ( 1 ) g ( x 0 ) f ( 0 ) > g ( x 0 ) f ( 0 ) and f 1 is strictly decreasing in [ 0 , f ( 0 ) ] , we have that
f 1 ( g ( 1 ) g ( x 0 ) f ( 0 ) ) < f 1 ( g ( x 0 ) f ( 0 ) ) .
Hence, I f , g ( x 0 , I f , g ( 1 , 0 ) ) > I f , g ( 1 , I f , g ( x 0 , 0 ) ) . Contradiction with the fact that I f , g satisfies (EP).
For the reverse implication we have two cases:
-
If f ( 0 ) = + then f ( 1 ) = f 1 and we obtain
I f , g ( x , I f , g ( y , z ) ) = f 1 ( g ( x ) · ( f f 1 ) ( g ( y ) f ( z ) ) ) = f 1 ( g ( x ) g ( y ) f ( z ) ) = f 1 ( g ( y ) · ( f f 1 ) ( g ( x ) f ( z ) ) = I f , g ( y , I f , g ( x , z ) ) .
Hence, I f , g satisfies (EP).
-
If f ( 0 ) < + and g ( 1 ) = 1 , since g is strictly increasing and f strictly decreasing then
g ( x ) f ( y ) f ( y ) f ( 0 ) for all x , y [ 0 , 1 ] .
Thus, in this case we have that I f , g ( x , y ) = f 1 ( g ( x ) f ( y ) ) for all x , y [ 0 , 1 ] and, similarly to the previous point, we can prove that I f , g satisfies (EP).
Proposition 11.
Let ( f , g ) be an admissible pair of generators and T a t-norm. Then the following statements are equivalent:
(i)
The couple of functions I f , g and T satisfy ( LI T ) .
(ii)
g ( 1 ) = 1 and T = ( T P ) g , i.e., T ( x , y ) = g 1 ( g ( x ) g ( y ) ) for all x , y [ 0 , 1 ] .
Proof. 
First, let us consider g ( 1 ) = 1 and T ( x , y ) = g 1 ( g ( x ) g ( y ) ) , then g ( x ) [ 0 , 1 ] for all x [ 0 , 1 ] and we have that
I f , g ( T ( x , y ) , z ) = f ( 1 ) ( g ( x ) g ( y ) f ( z ) ) = f 1 ( g ( x ) g ( y ) f ( z ) ) .
On the other hand, by the strictly decreasing nature of f we have that
g ( x ) f ( y ) f ( y ) f ( 0 ) for all x , y [ 0 , 1 ] .
Then, I f , g ( x , y ) = f 1 ( g ( x ) f ( y ) ) for all x , y [ 0 , 1 ] and we get
I f , g ( x , I f , g ( y , z ) ) = f 1 ( g ( x ) g ( y ) f ( z ) ) .
Hence, I f , g satisfies ( LI T ) with respect to ( T P ) g . Now, let us assume that I f , g satisfies ( LI T ) with respect to a certain t-norm T, we know that I f , g also satisfies (EP). Then, by Proposition 10 f ( 0 ) = + or ( g ( 1 ) = 1 and f ( 0 ) < + ) and we have two cases:
-
If f ( 0 ) = + we know that f ( 1 ) = f 1 . Therefore, for all x , y , z [ 0 , 1 ] , we find that
I f , g ( T ( x , y ) , z ) = I f , g ( x , I f , g ( x , y ) ) f 1 ( g ( T ( x , y ) ) f ( z ) ) = f 1 ( g ( x ) g ( y ) f ( z ) ) g ( T ( x , y ) ) = g ( x ) g ( y ) .
Now, since T is a t-norm, for all y ( 0 , 1 ) we have
g ( y ) = g ( T ( 1 , y ) ) = g ( 1 ) g ( y ) ,
hence, g ( 1 ) = 1 . Then g ( x ) g ( y ) [ 0 , 1 ] and T ( x , y ) = g 1 ( g ( x ) g ( y ) ) for all x , y [ 0 , 1 ] .
-
On the other hand, if f ( 0 ) < + and g ( 1 ) = 1 , then we know from the proof of Proposition 10 that in this case I f , g ( x , y ) = f 1 ( g ( x ) f ( y ) ) and from the equality
I f , g ( T ( x , y ) , z ) = I f , g ( x , I f , g ( y , z ) ) g ( T ( x , y ) ) f ( z ) = g ( x ) g ( y ) f ( z ) ,
we obtain the result.
It is worth noting that if g ( 1 ) 1 , then these implications do not satisfy the law of importation with any t-norm, which is a huge difference from the particular case of the f-generated implications whose characterization in [11] is based on this property. Moreover, note that this family of fuzzy implication functions provides new examples of functions satisfying the exchange principle, but not the law of importation with respect to any t-norm. The main consequence of these previous results is that while ( f , g ) -implications are not adequate for simplifying the process of applying the compositional rule of inference (CRI) of Zadeh (see [32]), some of them can be applied in approximate reasoning.

4.2. Generalization of g-Generated Implications

Now, we introduce a similar generalization for the g-generated implications by replacing the role of 1 x in their definition for a strictly decreasing function f : [ 0 , 1 ] [ 0 , + ] with f ( 0 ) = + .
Definition 10.
Let g : [ 0 , 1 ] [ 0 , + ] be a strictly increasing and continuous function with g ( 0 ) = 0 and f : [ 0 , 1 ] [ 0 , + ] be a continuous and strictly decreasing function with f ( 0 ) = + . The function I : [ 0 , 1 ] 2 [ 0 , 1 ] defined by
I g , f ( x , y ) = g ( 1 ) ( f ( x ) g ( y ) ) , x , y [ 0 , 1 ] ,
with the understanding 0 · ( + ) = + and 1 0 = + , is called a ( g , f ) -generated operation.
Remark 3.
The use of the pseudo-inverse in Equation (5) can be avoided using the following expression
I g , f ( x , y ) = g 1 ( min { f ( x ) g ( y ) , g ( 1 ) } ) , x , y [ 0 , 1 ] .
As in the case of the ( f , g ) -operations, not for all pairs of functions ( g , f ) under the previous conditions we obtain a fuzzy implication function.
Theorem 5.
A ( g , f ) -operation I g , f is a fuzzy implication function if and only if, one of the following conditions hold:
(i)
g ( 1 ) = + .
(ii)
g ( 1 ) < + and f ( 1 ) 1 .
Proof. 
First, let us assume that I g , f is a fuzzy implication function such that g ( 1 ) < + . In this case, we have
1 = I g , f ( 1 , 1 ) = g ( 1 ) ( f ( 1 ) g ( 1 ) ) = g 1 ( f ( 1 ) g ( 1 ) ) if f ( 1 ) < 1 , 1 if f ( 1 ) 1 .
Hence, necessarily f ( 1 ) 1 .
On the other hand, consider a ( g , f ) -operation satisfying (i) or (ii).
-
Let x 1 , x 2 , y [ 0 , 1 ] with x 1 x 2 . Since f is strictly decreasing, then f ( x 1 ) f ( x 2 ) . Now, since g is strictly increasing, g ( 1 ) is increasing and we find
I g , f ( x 1 , y ) = g ( 1 ) ( f ( x 1 ) g ( y ) ) g ( 1 ) ( f ( x 2 ) g ( y ) ) = I g , f ( x 2 , y ) ,
and I g , f satisfies (I1).
-
Consider x , y 1 , y 2 [ 0 , 1 ] with y 1 y 2 , since g and g ( 1 ) are increasing, then g ( y 1 ) g ( y 2 ) and we find that
I g , f ( x , y 1 ) = g ( 1 ) ( f ( x ) g ( y 1 ) ) g ( 1 ) ( f ( x ) g ( y 2 ) ) = I g , f ( x , y 2 ) ,
then I g , f satisfies (I2).
-
I g , f ( 0 , 0 ) = g ( 1 ) ( f ( 0 ) g ( 0 ) ) = g ( 1 ) ( + · 0 ) = g ( 1 ) ( + ) = 1 .
-
I g , f ( 1 , 1 ) = g ( 1 ) ( g ( 1 ) f ( 1 ) ) and we need to distinguish two cases. If g ( 1 ) = + , then we have that I g , f ( 1 , 1 ) = g 1 ( + ) = 1 . On the other hand, if g ( 1 ) < + and f ( 1 ) 1 , then g ( 1 ) f ( 1 ) g ( 1 ) and we get that I g , f ( 1 , 1 ) = 1 .
-
I g , f ( 1 , 0 ) = g ( 1 ) ( f ( 1 ) g ( 0 ) ) = g ( 1 ) ( f ( 1 ) · 0 ) = g ( 1 ) ( 0 ) = 0 .
Remark 4.
In [22], a similar approach was considered. The authors define the family of fuzzy implication functions given by I ( x , y ) = g ( 1 ) ( f ( x ) g ( y ) ) where f : [ 0 , 1 ] [ 1 , + ] is a continuous, decreasing function satisfying f ( 0 ) = + , f ( 1 ) = 1 and g is a g-generator. In this case, they consider functions f not necessarily strictly decreasing, but with f ( 1 ) = 1 . In our case, we consider functions f, which are strictly decreasing, but we allow any value in ( 0 , + ) of f ( 1 ) whenever g ( 1 ) = + and f ( 1 ) 1 when g ( 1 ) < + . Then, the two families are not equivalent, but they have intersection when we consider a continuous, strictly decreasing function with f ( 1 ) = 1 . However, since the two families are very similar, one can verify that the conditions that ensure that the two families fulfill a certain property are very similar in the two cases.
Whenever a ( g , f ) -operation satisfies the properties given in Definition 3, we will call it a ( g , f ) -implication with their associated admissible pair of generators ( g , f ) .
In a similar way as in the ( f , g ) -implications, for ( g , f ) -implications, it is only necessary to consider those pairs of admissible generators ( g , f ) such that g ( 1 ) = 1 or g ( 1 ) = + , as it is shown in the following result.
Proposition 12.
Let I g , f be a fuzzy implication function with g ( 1 ) < + , then there exists a function g 1 with g 1 ( 1 ) = 1 such that ( g 1 , f ) is an admissible pair of generators and I g , f = I g 1 , f .
Proof. 
Let I g , f be a fuzzy implication function with g ( 1 ) < + . If we consider g 1 ( x ) = g ( x ) g ( 1 ) , then ( g 1 , f ) is also an admissible pair of generators with g 1 ( 1 ) = 1 . Moreover, g 1 1 ( x ) = g 1 ( x g ( 1 ) ) and we find that
I g 1 , f ( x ) = g 1 ( 1 ) ( f ( x ) g 1 ( y ) ) = g 1 ( 1 ) f ( x ) g ( y ) g ( 1 ) = g 1 1 min f ( x ) g ( y ) g ( 1 ) , g 1 ( 1 ) = g 1 ( min { f ( x ) g ( y ) , g ( 1 ) } ) = I g , f ( x , y ) .
Now, we will follow a similar approach to the previous section in order to study the properties of these fuzzy implication functions. Let us start by studying the region where the ( g , f ) -implications take value 1. Notice that ( g , f ) -implications may have a non-trivial 1 region.
Proposition 13.
Let ( g , f ) be an admissible pair of generators. Then, the following statements hold:
(i)
If g ( 1 ) = + , then I g , f ( x , y ) = 1 x = 0 or y = 1 .
(ii)
If g ( 1 ) < + , then I g , f ( x , y ) = 1 y g 1 g ( 1 ) f ( x ) .
Proof. 
(i)
If g ( 1 ) = + , we know that g ( 1 ) = g 1 and then for any x , y [ 0 , 1 ] we have
I g , f ( x , y ) = g 1 ( f ( x ) g ( y ) ) = 1 f ( x ) g ( y ) = g ( 1 ) = + f ( x ) = + or g ( y ) = + x = 0 or y = 1 .
(ii)
If g ( 1 ) < + , then by the definition of g ( 1 ) , for every x , y [ 0 , 1 ] we know that
I g , f ( x , y ) = g ( 1 ) ( f ( x ) g ( y ) ) = 1 f ( x ) g ( y ) g ( 1 ) y g 1 g ( 1 ) f ( x ) .
From the previous result we can see that unlike the ( f , g ) -implications, ( g , f ) -implications satisfy the identity principle in certain cases.
Corollary 2.
Let ( g , f ) be an admissible pair of generators. Then I g , f satisfies(IP)if and only if g ( 1 ) < + and f ( x ) g ( 1 ) g ( x ) for all x [ 0 , 1 ] .
On the other hand, in the following proposition study, the region where these fuzzy implication functions value zero. This result has been corrected since in ([19], Proposition 9) the case when f ( 1 ) = 0 was not contemplated.
Proposition 14.
Let ( g , f ) be an admissible pair of generators. Then the following statements hold:
(i)
If f ( 1 ) > 0 , then I g , f ( x , y ) = 0 if and only if x > 0 and y = 0 .
(ii)
If f ( 1 ) = 0 and g ( 1 ) = + , then I g , f ( x , y ) = 0 if and only if ( x = 1 and y < 1 ) or ( x > 0 and y = 0 ).
Proof. 
Consider x , y [ 0 , 1 ] then
I g , f ( x , y ) = g ( 1 ) ( f ( x ) g ( y ) ) = 0 f ( x ) g ( y ) = 0 .
Taking into account that either g ( 1 ) = + or g ( 1 ) < + and f ( 1 ) 1 and the understanding 0 · ( + ) = + we obtain the result. □
From the last result, it is straightforward that these fuzzy implication functions satisfy that their natural negation is N D 1 . Then, the natural negation of ( g , f ) -implications is independent of their generators.
Corollary 3.
Let ( g , f ) be an admissible pair of generators. Then, the natural negation N I g , f is the Gödel or least fuzzy negation N D 1 .
The next result reflects that, as in the case of (IP), the property (OP) can be satisfied by ( g , f ) -implications under certain conditions of their generators. This result has been corrected with respect to the original one ([19], [Proposition 11]) since the expression in (iii) was not correct. Moreover, we explicitly find the constant in item (ii).
Proposition 15.
Let ( g , f ) be an admissible pair of generators. Then, the following statements are equivalent:
(i)
I g , f satisfies(OP).
(ii)
g ( 1 ) < + and f ( x ) = g ( 1 ) g ( x ) .
(iii)
f ( 1 ) = 1 and I g , f ( x , y ) = f 1 max 1 , f ( y ) f ( x ) .
Proof. 
(i)⇒ (ii). Let us assume I g , f satisfies (OP). By Proposition 13 we know that in this case g ( 1 ) = + is not possible. Considering g ( 1 ) < + we know from Proposition 12 that considering the function g 1 ( x ) = g ( x ) g ( 1 ) we have that I g 1 , f = I g , f with g 1 ( 1 ) = 1 . Then,
I g 1 , f ( x , y ) = 1 y g 1 1 g 1 ( 1 ) f ( x ) f ( x ) 1 g 1 ( y ) .
Thus, if I g , f satisfies (OP), we have that
x y f ( x ) 1 g 1 ( y ) .
We will prove that f ( x ) = 1 g 1 ( x ) for all x [ 0 , 1 ] . For x = 0 we have that
1 g 1 ( 0 ) = 1 0 = + = f ( 0 ) .
For x = 1 , by Equation (7) we obtain that
f ( 1 ) < 1 g 1 ( y ) , for all 0 y < 1 .
Taking limits we get that
f ( 1 ) lim y 1 1 g 1 ( y ) = 1 ,
and since we already had that f ( 1 ) 1 it holds that f ( 1 ) = 1 = 1 g 1 ( 1 ) . Finally, suppose that for some x 0 ( 0 , 1 ) the equality does not hold. By Equation (7), we have that
f ( x 0 ) 1 g 1 ( x 0 ) ,
then let us assume that f ( x 0 ) > 1 g 1 ( x 0 ) . We consider the following continuous function
h 1 ( y ) = f ( x 0 ) g 1 ( y ) ,
then, we have that h 1 ( 0 ) = f ( x 0 ) g 1 ( 0 ) = 0 and h 1 ( x 0 ) = f ( x 0 ) g 1 ( x 0 ) > 1 . However, then there exists a y 0 ( 0 , x 0 ) such that f ( x 0 ) g 1 ( y 0 ) = 1 . Contradiction with Equation (7). Then, we have proved that f ( x ) = 1 g 1 ( x ) = g ( 1 ) g ( x ) for all x [ 0 , 1 ] .
(ii) ⇒ (iii) If g ( 1 ) < + and f ( x ) = g ( 1 ) g ( x ) , then the result follows replacing g 1 ( x ) by f 1 g ( 1 ) x in Equation (6).
(iii) ⇒ (i) Let us prove that I g , f ( x , y ) < 1 y < x . Consider x , y [ 0 , 1 ] then
I g , f ( x , y ) = f 1 max 1 , f ( y ) f ( x ) < 1 max 1 , f ( y ) f ( x ) > f ( 1 ) = 1 f ( y ) f ( x ) > 1 .
Since f is strictly decreasing we get that
I g , f ( x , y ) < 1 f ( y ) > f ( x ) y < x .
Consecutively, the next result deals with the continuity of ( g , f ) -implications. We already know from Proposition 3 that these implications are never continuous at ( 0 , 0 ) , since their natural negation is N D 1 . Similarly from ( f , g ) -implications, the next result shows that ( 0 , 0 ) and ( 1 , 1 ) are the only possible points of discontinuity.
Proposition 16.
Let ( g , f ) be an admissible pair of generators. Then, the following properties hold:
(i)
I g , f is continuous everywhere except at the point ( 0 , 0 ) if and only if g ( 1 ) < + or ( g ( 1 ) = + and f ( 1 ) > 0 ).
(ii)
I g , f is continuous everywhere except at the points ( 0 , 0 ) and ( 1 , 1 ) if and only if g ( 1 ) = + and f ( 1 ) = 0 .
Proof. 
Let ( g , f ) be an admissible pair of generators, then by definition I g , f is continuous at each ( x , y ) [ 0 , 1 ] 2 by being the composition of real continuous functions except for the cases when ( f ( x ) = 0 and g ( y ) = + ) or ( g ( y ) = 0 and f ( x ) = + ), since in these situations we have considered the convention 0 · ( + ) = + . These two situations correspond to the following two cases:
  • If x = y = 1 and f ( 1 ) = 0 then g ( 1 ) < + and
    lim y 1 I g , f ( 1 , y ) = lim y 1 g 1 ( f ( 1 ) g ( y ) ) = g 1 ( 0 ) = 0 1 = I g , f ( 1 , 1 ) .
    Thus, I g , f is discontinuous at ( 1 , 1 ) .
  • x = y = 0 then we know by Corollary 3 that I g , f is not continuous at ( 0 , 0 ) for any choice of its generators.
Finally, we study the properties (EP) and ( LI T ) for these fuzzy implication functions.
Proposition 17.
Let ( g , f ) be an admissible pair of generators. Then, I g , f always satisfies(EP).
Proof. 
We distinguish between two cases:
  • If g ( 1 ) = + , then for each x , y , z [ 0 , 1 ] we find that g ( 1 ) = g 1 and then
    I g , f ( x , I g , f ( y , z ) ) = g 1 ( f ( x ) f ( y ) g ( z ) ) = I g , f ( y , I g , f ( x , z ) ) .
  • If g ( 1 ) < + and f ( 1 ) 1 , consider x , y , z [ 0 , 1 ] and let us distinguish two cases:
    -
    If f ( x ) f ( y ) g ( z ) g ( 1 ) then, since f ( x ) f ( 1 ) 1 , we find that
    g ( 1 ) f ( x ) g ( z ) and g ( 1 ) f ( y ) g ( z ) .
    Then, we get
    I g , f ( x , I g , f ( y , z ) ) = g ( 1 ) ( f ( x ) ( g g ( 1 ) ) ( f ( y ) g ( z ) ) ) = g ( 1 ) ( f ( x ) f ( y ) g ( z ) ) = g ( 1 ) ( f ( y ) ( g g ( 1 ) ) ( f ( x ) g ( z ) ) ) = I g , f ( y , I g , f ( x , z ) ) .
    -
    If f ( x ) f ( y ) g ( z ) > g ( 1 ) , then we find that
    I g , f ( x , I g , f ( y , z ) ) = g ( 1 ) ( f ( x ) f ( y ) g ( z ) ) if f ( y ) g ( z ) g ( 1 ) , g ( 1 ) ( f ( x ) g ( 1 ) ) if f ( y ) g ( z ) > g ( 1 ) .
    In any case, since f ( x ) f ( y ) g ( z ) > g ( 1 ) and f ( x ) g ( 1 ) g ( 1 ) , it is always I g , f ( x , I g , f ( y , z ) ) = 1 . An analogous argument proves that I g , f ( y , I g , f ( x , z ) ) = 1 .
Proposition 18.
Let ( g , f ) be an admissible pair of generators and T a t-norm. Then, the following statements are equivalent:
(i)
The couple of functions I g , f and T satisfy ( LI T ) .
(ii)
f ( 1 ) = 1 and T ( x , y ) = f 1 ( f ( x ) f ( y ) ) for all x , y [ 0 , 1 ] .
Proof. 
(i) ⇒ (ii) Let us distinguish between two cases:
  • If g ( 1 ) = + then
    I ( T ( x , y ) , z ) = I ( x , I ( y , z ) ) g 1 ( f ( T ( x , y ) ) g ( z ) ) = g 1 ( f ( x ) f ( y ) g ( z ) ) f ( T ( x , y ) ) = f ( x ) f ( y ) .
    Since T is a t-norm we have that for all y ( 0 , 1 ) , f ( y ) = f ( T ( 1 , y ) ) = f ( 1 ) f ( y ) . Thus, f ( 1 ) = 1 and T ( x , y ) = f 1 ( f ( x ) f ( y ) ) .
  • If g ( 1 ) < + and f ( 1 ) 1 , from the proof of Proposition 17, we deduce the following equality
    I g , f ( x , I g , f ( y , z ) ) = g 1 ( f ( x ) f ( y ) g ( z ) ) if f ( x ) f ( y ) g ( z ) < g ( 1 ) , 1 if f ( x ) f ( y ) g ( z ) g ( 1 ) .
    On the other hand, we have that
    I g , f ( T ( x , y ) , z ) = g 1 ( f ( T ( x , y ) ) g ( z ) ) if f ( T ( x , y ) ) g ( z ) < g ( 1 ) , 1 if f ( T ( x , y ) ) g ( z ) g ( 1 ) .
    Now, first let us prove that f ( 1 ) = 1 . Since g is continuous with g ( 0 ) = 0 , for all y ( 0 , 1 ] we can find some z ( 0 , 1 ) such that f ( 1 ) f ( y ) g ( z ) g ( 1 ) and by f ( 1 ) 1 we have that f ( y ) g ( z ) g ( 1 ) . Since I g , f and T satisfy ( LI T ) , we find that
    g 1 ( f ( 1 ) f ( y ) g ( z ) ) = I g , f ( 1 , I g , f ( y , z ) ) = I g , f ( T ( 1 , y ) , z ) = I g , f ( y , z ) = g 1 ( f ( y ) g ( z ) ) .
    Thus, f ( 1 ) = 1 . If x , y [ 0 , 1 ] ( 0 , 1 ) is straightforward to see that T ( x , y ) = f 1 ( f ( x ) f ( y ) ) . Let us assume f ( T ( x , y ) ) f ( x ) f ( y ) for some x , y ( 0 , 1 ) and get a contradiction. We have two cases:
    -
    If f ( T ( x , y ) ) < f ( x ) f ( y ) then we choose z = g 1 g ( 1 ) f ( x ) f ( y ) and we get that
    f ( x ) f ( y ) g ( z ) = f ( x ) f ( y ) g ( 1 ) f ( x ) f ( y ) = g ( 1 ) ,
    then I g , f ( x , I g , f ( y , z ) ) = 1 . However, on the other hand,
    f ( T ( x , y ) ) g ( z ) = f ( T ( x , y ) ) f ( x ) f ( y ) g ( 1 ) < g ( 1 ) ,
    and then I g , f ( T ( x , y ) , z ) < 1 .
    -
    If f ( T ( x , y ) ) > f ( x ) f ( y ) , let us consider z = g 1 g ( 1 ) f ( T ( x , y ) ) . Then, we have that
    f ( T ( x , y ) ) g ( z ) = g ( 1 ) ,
    and then I g , f ( T ( x , y ) , z ) = 1 . Otherwise,
    f ( x ) f ( y ) g ( z ) = f ( x ) f ( y ) f ( T ( x , y ) ) g ( 1 ) < g ( 1 ) ,
    and I g , f ( x , I g , f ( y , z ) ) < 1 .
(ii) ⇒ (i) Let us consider an admissible pair of generators ( g , f ) with f ( 1 ) = 1 and T ( x , y ) = f 1 ( f ( x ) f ( y ) ) , then
I g , f ( T ( x , y ) , z ) = g ( 1 ) ( ( f f 1 ) ( f ( x ) f ( y ) ) g ( z ) ) = g ( 1 ) ( f ( x ) f ( y ) g ( z ) ) .
On the other hand, since f is strictly decreasing and g strictly increasing then f ( y ) g ( z ) f ( 1 ) g ( z ) = g ( z ) g ( 1 ) and
I g , f ( x , I g , f ( y , z ) ) = I g , f ( x , g ( 1 ) ( f ( y ) g ( z ) ) ) = I g , f ( x , g 1 ( f ( y ) g ( z ) ) ) = g ( 1 ) ( f ( x ) f ( y ) g ( z ) ) .
In a similar way to ( f , g ) -implications, although ( g , f ) -implications always satisfy (EP) if f ( 1 ) > 1 , they do not satisfy ( LI T ) with respect to any t-norm.

5. Conclusions and Future Work

In this paper, our main interest has been to study the family of generalized ( h , e ) -implications. Although these fuzzy implication functions were first defined in [15], we have considered the more general definition given in [18] and hence, all the results have been adapted to this definition. Then, we have recalled the representation theorem for ( h , e ) -implications presented in [19]. This theorem fully determines the structure of a generalized ( h , e ) -implication given an f and g-generator with g ( 1 ) = + . However, in order to properly study this structure, the necessity of defining two novel families of fuzzy implication functions which are generalizations of Yager’s implications has been exposed. In this sense, the additional properties of these two families of fuzzy implication functions, namely ( f , g ) and ( g , f ) -implications, have been fully investigated. Although these properties were already presented in [19] without proof, in this paper we have proved all the results. Moreover, some of the results in [19] were not fully correct and therefore, these results have been corrected.
As future work, we want to complete our study by providing an axiomatic characterization of generalized ( h , e ) -implications. In order to provide this characterization, we want to follow the same approach as in the case of h-implications, i.e., we want to provide axiomatic characterizations of the subfamilies of ( f , g ) and ( g , f ) -implications involved in the representation theorem of generalized ( h , e ) -implications and to use these results to derive the axiomatic characterization of generalized ( h , e ) -implications.

Author Contributions

Conceptualization, R.F.-P., S.M. and A.M.; methodology, R.F.-P., S.M. and A.M.; validation, R.F.-P., S.M. and A.M.; formal analysis, R.F.-P., S.M. and A.M.; investigation, R.F-P., S.M. and A.M.; resources, R.F.-P., S.M. and A.M.; writing—original draft preparation, R.F.-P.; writing—review and editing, R.F.-P., S.M. and A.M.; visualization, R.F.-P., S.M. and A.M.; supervision, S.M. and A.M.; project administration, S.M.; funding acquisition, S.M. All authors have read and agreed to the published version of the manuscript.

Funding

This paper has been partially supported by the Spanish Grant FEDER/Ministerio de Economía, Industria y Competitividad—AEI/TIN2016-75404-P. Raquel Fernandez-Peralta benefits from the fellowship FPU18/05664 granted by the Spanish Ministry of Science, Innovation and Universities within the Training University Lecturers (FPU) program.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Baczyński, M.; Jayaram, B.; Massanet, S.; Torrens, J. Fuzzy Implications: Past, Present, and Future. In Springer Handbook of Computational Intelligence; Springer: Berlin/Heidelberg, Germany, 2015; pp. 183–202. [Google Scholar]
  2. Baczyński, M.; Jayaram, B. (S,N)- and R-implications: A state-of-the-art survey. Fuzzy Sets Syst. 2008, 159, 1836–1859. [Google Scholar] [CrossRef]
  3. Mas, M.; Monserrat, M.; Torrens, J.; Trillas, E. A Survey on Fuzzy Implication Functions. IEEE Trans. Fuzzy Syst. 2007, 15, 1107–1121. [Google Scholar] [CrossRef]
  4. Baczyński, M.; Beliakov, G.; Bustince, H.; Pradera, A. Advances in Fuzzy Implication Functions; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  5. Baczyński, M.; Jayaram, B. Fuzzy Implications; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2008; Volume 231. [Google Scholar]
  6. Massanet, S.; Pradera, A.; Ruiz-Aguilera, D.; Torrens, J. From three to one: Equivalence and characterization of material implications derived from co-copulas, probabilistic S-implications and survival S-implications. Fuzzy Sets Syst. 2017, 323, 103–116. [Google Scholar] [CrossRef]
  7. Baczyński, M.; Jayaram, B. On the characterizations of (S,N)-implications. Fuzzy Sets Syst. 2007, 158, 1713–1727. [Google Scholar] [CrossRef]
  8. Fodor, J.C.; Roubens, M. Fuzzy Preference Modelling and Multicriteria Decision Support; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1994. [Google Scholar]
  9. Miyakoshi, M.; Shimbo, M. Solutions of composite fuzzy relational equations with triangular norms. Fuzzy Sets Syst. 1985, 16, 53–63. [Google Scholar] [CrossRef]
  10. Shi, Y.; Van Gasse, B.; Ruan, D.; Kerre, E. On the first place antitonicity in QL-implications. Fuzzy Sets Syst. 2008, 159, 2988–3013. [Google Scholar] [CrossRef] [Green Version]
  11. Massanet, S.; Torrens, J. On the characterization of Yager’s implications. Inf. Sci. 2012, 201, 1–18. [Google Scholar] [CrossRef]
  12. 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]
  13. 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]
  14. Baczyński, M.; Jayaram, B. (U,N)-implications and their characterizations. Fuzzy Sets Syst. 2009, 160, 2049–2062. [Google Scholar] [CrossRef] [Green Version]
  15. Massanet, S.; Torrens, J. On a new class of fuzzy implications: h-Implications and generalizations. Inf. Sci. 2011, 181, 2111–2127. [Google Scholar] [CrossRef]
  16. Massanet, S.; Torrens, J. The law of importation versus the exchange principle on fuzzy implications. Fuzzy Sets Syst. 2011, 168, 47–69. [Google Scholar] [CrossRef]
  17. González-Hidalgo, M.; Massanet, S.; Mir, A.; Ruiz-Aguilera, D. On the Choice of the Pair Conjunction–Implication Into the Fuzzy Morphological Edge Detector. IEEE Trans. Fuzzy Syst. 2015, 23, 872–884. [Google Scholar] [CrossRef]
  18. Hliněná, D.; Kalina, M.; Král’, P. Implication Functions Generated Using Functions of One Variable. In Advances in Fuzzy Implication Functions; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2013; Volume 300, pp. 125–153. [Google Scholar]
  19. Massanet, S.; Torrens, J. An extension of Yager’s implications. In Proceedings of the 8th Conference of the European Society for Fuzzy Logic and Technology, EUSFLAT-13, Milano, Italy, 11–13 September 2013; Montero, J., Pasi, G., Ciucci, D., Eds.; Atlantis Press: Dordrecht, The Netherlands, 2013. Advances in Intelligent Systems Research. pp. 637–644. [Google Scholar]
  20. Vemuri, N.R.; Jayaram, B. Fuzzy Implications: Novel Generation Process and the Consequent Algebras. In Advances in Computational Intelligence; Communications in Computer and Information Science. IPMU 2012; Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R., Eds.; Springer: Berlin/Heidelberg, Germany, 2012; Volume 298, pp. 365–374. [Google Scholar]
  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. Zhu, Y.; Pei, D.W. Generalized G-Generated Implications. In Quantitative Logic and Soft Computing 2016; Advances in Intelligent Systems and Computing; Fan, T.H., Chen, S.L., Wang, S.M., Li, Y.M., Eds.; Springer International Publishing: Cham, Switzerland, 2017; Volume 510, pp. 239–249. [Google Scholar]
  23. Hliněná, D.; Kalina, M.; Král’, P. Generated Implications Revisited. In Advances in Computational Intelligence; Communications in Computer and Information Science. IPMU 2012; Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R., Eds.; Springer: Berlin/Heidelberg, Germany, 2012; Volume 298, pp. 345–354. [Google Scholar]
  24. Massanet, S.; Torrens, J. On a Generalization of Yager’s Implications. In Advances in Computational Intelligence; Communications in Computer and Information Science. IPMU 2012; Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R., Eds.; Springer: Berlin/Heidelberg, Germany, 2012; Volume 298, pp. 315–324. [Google Scholar]
  25. Zhang, F.X.; Liu, H.W. On a new class of implications: (g,u)-implications and the distributive equations. Int. J. Approx. Reason. 2013, 54, 1049–1065. [Google Scholar] [CrossRef]
  26. Liu, H. On a New Class of Implications: (G, Min)-Implications and Several Classical Tautologies. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 2012, 20, 1–20. [Google Scholar] [CrossRef]
  27. Zhang, F.X.; Zhang, X.F. On Some New Generalizations of Yager’s Implications. In Quantitative Logic and Soft Computing 2016; Advances in Intelligent Systems and Computing; Fan, T.H., Chen, S.L., Wang, S.M., Li, Y.M., Eds.; Springer International Publishing: Cham, Switzerland, 2017; Volume 510, pp. 587–596. [Google Scholar]
  28. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  29. Massanet, S.; Torrens, J. An Overview of Construction Methods of Fuzzy Implications. In Advances in Fuzzy Implication Functions; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2013; Volume 300, pp. 1–30. [Google Scholar]
  30. De Baets, B.; Fodor, J. Residual operators of uninorms. Soft Comput. 1999, 3, 89–100. [Google Scholar] [CrossRef]
  31. Bustince, H.; Fernandez, J.; Sanz, J.; Baczyński, M.; Mesiar, R. Construction of strong equality index from implication operators. Fuzzy Sets Syst. 2013, 211, 15–33. [Google Scholar] [CrossRef]
  32. Zadeh, L.A. Outline of a New Approach to the Analysis of Complex Systems and Decision Processes. IEEE Trans. Syst. Man Cybern. 1973, SCM-3, 28–44. [Google Scholar] [CrossRef] [Green Version]
Figure 2. Plot of an ( h , e ) -implication with e = 1 2 constructed via the horizontal threshold method jointly with its generators. (a) I1, (b) I2, (c) I h g , e .
Figure 2. Plot of an ( h , e ) -implication with e = 1 2 constructed via the horizontal threshold method jointly with its generators. (a) I1, (b) I2, (c) I h g , e .
Mathematics 09 01490 g002
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Fernandez-Peralta, R.; Massanet, S.; Mir, A. Study of Two Families of Generalized Yager’s Implications for Describing the Structure of Generalized (h,e)-Implications. Mathematics 2021, 9, 1490. https://doi.org/10.3390/math9131490

AMA Style

Fernandez-Peralta R, Massanet S, Mir A. Study of Two Families of Generalized Yager’s Implications for Describing the Structure of Generalized (h,e)-Implications. Mathematics. 2021; 9(13):1490. https://doi.org/10.3390/math9131490

Chicago/Turabian Style

Fernandez-Peralta, Raquel, Sebastia Massanet, and Arnau Mir. 2021. "Study of Two Families of Generalized Yager’s Implications for Describing the Structure of Generalized (h,e)-Implications" Mathematics 9, no. 13: 1490. https://doi.org/10.3390/math9131490

APA Style

Fernandez-Peralta, R., Massanet, S., & Mir, A. (2021). Study of Two Families of Generalized Yager’s Implications for Describing the Structure of Generalized (h,e)-Implications. Mathematics, 9(13), 1490. https://doi.org/10.3390/math9131490

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