Next Article in Journal
Novel Fractional Grey Prediction Model with the Change-Point Detection for Overseas Talent Mobility Prediction
Previous Article in Journal
Machine Learning-Based Modelling and Meta-Heuristic-Based Optimization of Specific Tool Wear and Surface Roughness in the Milling Process
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Relaxed Indistinguishability Relations and Relaxed Metrics: The Aggregation Problem

by
Juan-De-Dios González-Hedström
1,
Juan-José Miñana
1,2,* and
Oscar Valero
1,2
1
Departament de Ciències Matemàtiques i Informàtica, Universitat de les Illes Balears, 07122 Palma de Mallorca, Spain
2
Institut d’ Investigació Sanitària Illes Balears (IdISBa), Hospital Universitari Son Espases, 07120 Palma de Mallorca, Spain
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(9), 431; https://doi.org/10.3390/axioms11090431
Submission received: 29 July 2022 / Revised: 18 August 2022 / Accepted: 23 August 2022 / Published: 26 August 2022

Abstract

:
The main purpose of this paper is to study the relationship between those functions that aggregate relaxed indistinguishability fuzzy relations with respect to a collection of t-norms and those functions that merge relaxed pseudo-metrics, extending the classical approach explored for pseudo-metrics and indistinguishability fuzzy relations. Special attention is paid to the distinguished class of S S I -relaxed indistinguishability fuzzy relations showing that functions merging this special type of relaxed indistinguishability fuzzy relations can be expressed through functions aggregating S S D -relaxed pseudo-metrics. Outstanding differences between those functions aggregating indistinguishability fuzzy relations and those that aggregate their counterpart separating points are shown.

1. Introduction

In [1], E. Trillas introduced the concept of indistinguishability fuzzy relation with respect to T (T-equivalence in [2]), where T is a t-norm. From now on, we assume that the reader is versed in the fundamentals of t-norms. A reference where such a theory is treated exhaustively is [2].
On account of [1] (see also [3]), an indistinguishability fuzzy relation with respect to T on a non-empty set X is a fuzzy set E : X × X [ 0 , 1 ] which satisfies, for each x , y , z X , the axioms below:
(I1)
E ( x , x ) = 1 ;
(I2)
E ( x , y ) = E ( y , x ) ;
(I3)
T ( E ( x , y ) , E ( y , z ) ) E ( x , z ) .
Following [2,3], an indistinguishability fuzzy relation with respect to T is called an indistinguishability fuzzy relation with respect to T that separates points (or T-equality) whenever
(I1’)
E ( x , y ) = 1 implies x = y .
Since Trillas introduced the concept of indistinguishability fuzzy relation, many works have focused their efforts both on the study of theoretical aspects and their applications. A few references devoted to the aforementioned aim are [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25].
In [25], a “metric behaviour” of indistinguishability fuzzy relations was proved (see also [9,10]). Concretely, a technique for generating extended pseudo-metrics from indistinguishability fuzzy relations, and vice versa was introduced. In order to introduce such a technique, let us recall that, according to [26], an extended pseudo-metric on a (non-empty) set X is a function d : X × X [ 0 , ] such that for all x , y , z X :
(d1)
d ( x , x ) = 0 ;
(d2)
d ( x , y ) = d ( y , x ) ;
(d3)
d ( x , z ) d ( x , y ) + d ( y , z ) .
An extended pseudo-metric d on X is said to be an extended metric when, in addition, it satisfies the following condition for all x , y X :
(d1’)
d ( x , y ) = 0 x = y .
Following [9,10,25], given an extended pseudo-metric d on X and a continuous Archimedean t-norm T with an additive generator f T , an indistinguishability fuzzy relation E d , f T with respect to T on X can be induced for all x , y X as follows:
E d , f T ( x , y ) = f T ( 1 ) ( d ( x , y ) ) ,
where f T ( 1 ) is the pseudo-inverse of f T . Let us recall that the pseudo-inverse f T ( 1 ) is given as follows:
f T ( 1 ) ( y ) = f T 1 ( y ) if 0 y < f T ( 0 ) 0 if f T ( 0 ) y .
Reciprocally, given an indistinguishability fuzzy relation E with respect to T on X, an extended pseudo-metric d can be generated on X for all x , y X , by
d ( x , y ) = f T ( E ( x , y ) ) .
Based on the exposed duality relationship between indistinguishability fuzzy relations and extended pseudo-metrics, A. Pradera, E. Trillas and E. Castiñeira studied the so-called aggregation problem for indistinguishability fuzzy relations. Thus, they gave a characterization of those functions that merge a collection of indistinguishability fuzzy relations into a single one in [27,28]. The aforementioned characterization establishes that such functions can always be obtained by means of those functions that aggregate a collection of extended pseudo-metrics into a single one. With the aim of recalling such a characterization, we introduce a few necessary notions exposed in [27,28].
Given a collection of t-norms T = { T i } i = 1 n ( n N ) and a non-empty set X, a collection of indistinguishability fuzzy binary relations E i i = 1 n is said to be a collection of T -indistinguishability fuzzy relations on X provided that each E i is an indistinguishability fuzzy binary relation on X with respect to T i for all i = 1 , , n . Moreover, given a t-norm T, a function F: [ 0 , 1 ] n [ 0 , 1 ] aggregates T -indistinguishability fuzzy relations into a T-indistinguishability fuzzy relation provided that F ( E 1 , , E n ) is an indistinguishability fuzzy relation with respect to T on a non-empty set X when { E i } i = 1 n is a collection of T -indistinguishability fuzzy relations on X. Furthermore, a function G: [ 0 , ] n [ 0 , ] aggregates extended pseudo-metrics into an extended pseudo-metric provided that G ( d 1 , , d n ) is an extended pseudo-metric on a non-empty set Y whenever { d i } i = 1 n is a collection of extended pseudo-metrics on Y, and the function G ( d 1 , , d n ) is given for all x , y Y , by
G ( d 1 , , d n ) ( x , y ) = G ( d 1 ( x , y ) , , d n ( x , y ) ) .
According to [29], an extended pseudo-metric d on X is called an s-bounded pseudo-metric whenever there exists s R + + { } such that d ( x , y ) s for all x , y X , where R + + = { a R + : a > 0 } . Observe that s-bounded extended pseudo-metrics are exactly extended pseudo-metrics when s = .
If we have a collection of ( s i ) i = 1 n -bounded pseudo-metrics { d i } i = 1 n on Y and s R + + { } , then a function H: i = 1 n [ 0 , s i ] [ 0 , s ] aggregates a collection of ( s i ) i = 1 n -bounded pseudo-metrics { d i } i = 1 n on Y provided that H ( d 1 , , d n ) is a s-bounded pseudo-metric on Y.
In the sequel, given a collection of continuous Archimedean t-norms T = { T i } i = 1 n , we will say that { f T i } i = 1 n is a collection of additive generators of T provided that each f T i is an additive generator of T i for all i = 1 , , n .
In consideration of the exposed concepts, the aforementioned characterization of functions aggregating T -indistinguishability fuzzy relations is provided by the result below (see [27]):
Theorem 1.
Let n N , let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms, and let { f T i } i = 1 n be a collection of additive generators of T . If T is a continuous Archimedean t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -indistinguishability fuzzy relations into a T-indistinguishability fuzzy relation.
(2) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded pseudo-metrics into a f T ( 0 ) -bounded pseudo-metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
Notice that all t-norms in the statement of Theorem 1 are continuous. This is due to the fact that such a condition cannot be removed in order to guarantee that the technique given by (1) generates T-indistinguishability fuzzy relations from extended pseudo-metrics. A counterexample where this fact is made explicit can be found in [9] [Example 3].
The following result can be deduced from the preceding one in the particular case in which all continuous Archimedean t-norms are assumed to be strict.
Corollary 1.
Let n N , and let T = { T i } i = 1 n be a collection of strict continuous Archimedean t-norms. If T is a strict continuous Archimedean t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -indistinguishability fuzzy relations into a T-indistinguishability fuzzy relation.
(2) 
The function H : [ 0 , + ] n [ 0 , ] aggregates every collection { d i } i = 1 n of extended pseudo-metrics into an extended pseudo-metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
The study, on the one hand, of the aggregation of fuzzy relations in general, and indistinguishability fuzzy relations in particular, and, on the other hand, of the aggregation of distances plays a relevant role in the literature in such a way that these topics are treated in outstanding monographs such as [3,26,30,31,32,33].
Regarding the aggregation of distances, J. Borsik and J. Doboš provided a description of those functions that are able to aggregate a collection of pseudo-metrics into a new one [31,34]. The same study was developed by Pradera and Trillas when bounded pseudo-metrics are under consideration [35]. The aforementioned description was given in terms of the so-called triangular triplets. Let us recall that a triplet ( a , b , c ) , with s [ 0 , ] and a , b , c [ 0 , s ] n ( n N ), is said to form an n-dimensional triangular triplet whenever, for all i = 1 , , n ,
a i b i + c i , b i a i + c i and c i b i + a i .
Notice that ≤ stands for the usual order in the extended real line.
The next result states the description given in [34,35].
Theorem 2.
Let s ] 0 , ] . Then the below assertions are equivalent:
(1) 
The function H : [ 0 , s ] n [ 0 , s ] aggregates every collection { d i } i = 1 n of s-bounded pseudo-metrics into an s-bounded pseudo-metric.
(2) 
The function H : [ 0 , s ] n [ 0 , s ] transforms n-dimensional triangular triplets in [ 0 , s ] n into a one-dimensional triangular triplet in [ 0 , s ] and H ( 0 , , 0 ) = 0 .
Observe that the fact that H : [ 0 , s ] n [ 0 , s ] transforms n-dimensional triangular triplets in [ 0 , s ] n into a one-dimensional triangular triplet in [ 0 , s ] must be understood as ( H ( a ) , H ( b ) , H ( c ) ) is a one-dimensional triangular triplet provided that ( a , b , c ) , with a , b , c [ 0 , s ] n , is an n-dimensional triangular triplet. It must be stressed that the description yielded by Borsik and Doboš is retrieved from the preceding result when s = .
Later on, G. Mayor and J. Recasens gave a description of those functions that aggregate indistinguishability fuzzy relations in [19]. The aforesaid description is based on a new notion that they called T-triangular triplet and that it is inspired by the triangular triplet concept of Borsik and Doboš. Concretely, given a t-norm T, a triplet ( a , b , c ) , with a , b , c [ 0 , 1 ] n , is said to be an n-dimensional T-triangular triplet provided, for all i = 1 , , n , that
T ( a i , b i ) c i , T ( a i , c i ) b i and T ( b i , c i ) a i .
In the spirit of Theorem 2, the new description of those functions that merge indistinguishability fuzzy relations was given as follows.
Theorem 3.
Let n N and let T be a t-norm. If F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T-indistinguishability fuzzy relations.
(2) 
F satisfies the following conditions:
(2.1) 
F ( 1 n ) = 1 , where 1 n [ 0 , 1 ] n with 1 n = ( 1 , , 1 ) .
(2.2) 
F transforms n-dimensional T-triangular triplets into one-dimensional T-triangular triplets.
Stimulated by the equivalence stated, on the one hand, in Theorem 3 and, on the other hand, in Theorem 1, the concept of T-triangular triplet was extended to the context of collections of t-norms T in [36]. Specifically, given a collection of t-norms T = { T i } i = 1 n , a triplet ( a , b , c ) , with a , b , c [ 0 , 1 ] n , is said to be an n-dimensional T -triangular triplet provided, for all i = 1 , , n , that
T i ( a i , b i ) c i , T i ( a i , c i ) b i and T i ( b i , c i ) a i .
In light of the preceding notion, the next new equivalence was given in [36].
Theorem 4.
Let n N and let T = { T i } i = 1 n be a collection of t-norms. If T is a t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -indistinguishability fuzzy relations into a T- indistinguishability fuzzy relation.
(2) 
F holds the following conditions:
(2.1) 
F ( 1 n ) = 1 , where 1 n [ 0 , 1 ] n with 1 n = ( 1 , , 1 ) .
(2.2) 
F transforms n-dimensional T -triangular triplets into a one-dimensional T-triangular triplet.
Observe that Theorem 3 is recovered as a particular case when the collection of t-norms T in Theorem 4 fulfills that T i = T for all i = 1 , , n .
When the T -indistinguishability fuzzy relations separate points, the next result, which differs significantly from Theorem 4, was also obtained in [36].
Theorem 5.
Let n N and let T = { T i } i = 1 n be a collection of t-norms. If T is a t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -indistinguishability fuzzy relations that separate points into a T-indistinguishability fuzzy relation that separates points.
(2) 
F holds the following conditions:
(2.1) 
F ( 1 n ) = 1 .
(2.2) 
Let a [ 0 , 1 ] n . If F ( a ) = 1 , then there exists i { 1 , , n } such that a i = 1 .
(2.3) 
If a , b , c [ 0 , 1 [ n such that ( a , b , c ) is an n-dimensional T -triangular triplet, then ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet.
In order to make the relationship between Theorems 1 and 4 clear, new equivalences between functions that merge T -indistinguishability fuzzy relations and those functions that are able to merge extended pseudo-metrics have been given recently in [37]. In particular, the following results were obtained.
Theorem 6.
Let n N , let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms, and let { f T i } i = 1 n be a collection of additive generators of T . If T is a continuous Archimedean t-norm and F: [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -indistinguishability fuzzy relations into a T-indistinguishability fuzzy relation.
(2) 
The function G: [ 0 , + ] n [ 0 , f T ( 0 ) ] transforms n-dimensional triangular triplets in [ 0 , ] n into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] and G ( 0 , , 0 ) = 0 , where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(3) 
The function G: [ 0 , + ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of extended pseudo-metrics into a f T ( 0 ) -bounded pseudo-metric, where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(4) 
The function H: i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] and H ( 0 , 0 ) = 0 , where H = f T F ( f T 1 1 × × f T n 1 ) .
In the particular case in which the indistinguishability fuzzy relations separate points, the equivalences below can be obtained ([37]).
Theorem 7.
Let n N and let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms. If T is a continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T - indistinguishability fuzzy relations that separate points into a T-indistinguishability fuzzy relation that separates points.
(2) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] , where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) , fulfills the following conditions:
(2.1) 
G ( 0 , , 0 ) = 0 ;
(2.2) 
Let a [ 0 , + ] n . If G ( a ) = 0 , then there exists i { 1 , , n } such that a i = 0 ;
(2.3) 
G transforms n-dimensional triangular triplets in [ 0 , + ] n into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
(3) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of extended metrics into an f T ( 0 ) -bounded metric, where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(4) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded metrics into an f T ( 0 ) -bounded metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
(5) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] , where H = f T F ( f T 1 1 × × f T n 1 ) , fulfills the following conditions:
(5.1) 
H ( 0 , , 0 ) = 0 ;
(5.2) 
Let a i = 1 n [ 0 , f T i ( 0 ) ] . If H ( a ) = 0 , then there exists i { 1 , , n } such that a i = 0 ;
(5.3) 
H transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
Although extended (pseudo-)metrics occupy a central place in the literature, their axiomatics limit their use in certain applications. In [38,39] (see also [40,41]), a new type of distance notion is introduced in order to develop suitable quantitative mathematical models and metric tools in computer science, appropriate, for instance, for program verification and logic programming. The aforesaid notion is called relaxed pseudo-metric in [42] (d-metric in [38,39,40,41]). Let us recall that, according to [42], a relaxed pseudo-metric on a (non-empty) set X is a function d : X × X [ 0 , ] such that for all x , y , z X :
(r1)
d ( x , y ) = d ( y , x ) ,
(r2)
d ( x , z ) d ( x , y ) + d ( y , z ) .
A relaxed pseudo-metric d on X is said to be a relaxed metric when, in addition, it satisfies the following condition for all x , y X :
(r3)
d ( x , y ) = d ( x , x ) = d ( y , y ) x = y .
Clearly, an extended pseudo-metric d on X is a relaxed pseudo-metric such that d ( x , x ) = 0 for all x X . However, there are relaxed pseudo-metrics which are not extended pseudo-metrics. Indeed, according to [43], the following is an instance of a relaxed pseudo-metric which is not an extended pseudo-metric. Let X = { 1 , 2 , 3 } and define d : X × X [ 0 , ] by
d ( x , y ) = 1 if ( x , y ) = ( 1 , 2 ) or ( x , y ) = ( 2 , 1 ) 1 2 otherwise .
A relaxed pseudo-metric d on a non-empty set X satisfies the small self-distances (SSD for short) property in the spirit of [44] whenever d ( x , x ) d ( x , y ) for all x , y X . In this case, we say that d is an S S D -relaxed pseudo-metric on X. Observe that the preceding example is an instance of an S S D -relaxed pseudo-metric. A celebrate special class of S S D -relaxed pseudo-metrics is known as a partial metric, and they have been applied to many fields in computer science (see, for instance, [38,39,40,41,45,46,47,48,49]).
Inspired by the dual relationship between T -indistinguishability fuzzy relations ( T -indistinguishability fuzzy relation that separates points) and extended pseudo-metrics (extended metrics), the techniques given by (1) and (2) were extended to the relaxed framework in [43]. To this end, it was necessary to introduce a new notion of indistinguishability which is known as relaxed indistinguishability fuzzy relation. Moreover, such indistinguishability fuzzy relations are suggested to be the logical counterpart of relaxed pseudo-metrics in [42] (see also [17,50]).
On account of [42] (see also [43]), the notion of relaxed indistinguishability fuzzy relation can be formulated as follows:
Let X be a non-empty set and let T : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] be a t-norm. A relaxed T-indistinguishability fuzzy relation E on X is a fuzzy set E : X × X [ 0 , 1 ] satisfying for all x , y , z X the following:
(R1)
E ( x , y ) = E ( y , x ) ,
(R2)
T ( E ( x , z ) , E ( z , y ) ) E ( x , y ) .
Moreover, a relaxed T-indistinguishability fuzzy relation E is said to separate points provided that the condition below is satisfied for all x , y X :
(R3)
E ( x , y ) = E ( x , x ) = E ( y , y ) x = y .
When a relaxed T-indistinguishability fuzzy relation E on X fulfills, for all x , y X , the condition
(R4)
E ( x , y ) E ( x , x ) ,
Then E is said to be an S S I -relaxed T-indistinguishability fuzzy relation. Notice that S S I stands for small self-indistinguishability.
Next, we give an easy, but illustrative, example of S S I -relaxed T-indistinguishability fuzzy relation which has been extracted from [43]. To this end, fix k [ 0 , 1 ] . Define the fuzzy binary relation E k : R + × R + [ 0 , 1 ] by
E k ( x , y ) = k
for x , y R + . Clearly, it is obvious that E k is an S S I -relaxed T M i n -indistinguishability fuzzy relation that does not separate points and, in addition, which is not a T M i n -indistinguishability fuzzy relation because E ( x , x ) = k 1 for each x R + . Observe that E k is na S S I -relaxed T M i n -indistinguishability fuzzy relation provided that it is an S S I -relaxed T-indistinguishability fuzzy relation for all t-norm T. We refer the reader to [43] [Example 3] for an instance of S S I -relaxed T-indistinguishability fuzzy relation that separates points.
It is worth mentioning that the techniques for generating, one from the other, indistinguishability fuzzy relations and extended pseudo-metrics can be adapted to the relaxed context simply interchanging indistinguishability fuzzy relations and extended pseudo-metrics by their corresponding relaxed counterpart in expressions (1) and (2) ([43] [Theorems 3 and 5]). An example of S S I -relaxed T P -indistinguishability fuzzy relation that does not separate points can be obtained through the technique given by (2) and using the relaxed pseudo-metric given by (3) (compare [43] [Example 7]).
Inspired by the characterizations exposed in terms of T -triangular triplets in Theorems 4 and 5, a new equivalence was stated for those functions that aggregate relaxed indistinguishability fuzzy relations in [36]. In order to introduce such an equivalence, let us recall that a collection of fuzzy relations E i i = 1 n is a collection of T -relaxed indistinguishability fuzzy relations when each E i is a relaxed indistinguishability fuzzy relation with respect to T i . Concretely, the next result was proved.
Theorem 8.
Let n N and let T = { T i } i = 1 n be a collection of t-norms. If T is a t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -relaxed indistinguishability fuzzy relations into a T-relaxed indistinguishability fuzzy relation.
(2) 
F transforms n-dimensional T -triangular triplets into a one-dimensional T-triangular triplet.
It must be stressed that a few properties of those functions that aggregate T -relaxed indistinguishability fuzzy relations into a T-relaxed indistinguishability fuzzy relation have been explored in [36]. In particular, every function F transforming n-dimensional T -triangular triplets into a one-dimensional T-triangular triplet must dominate T with respect to the collection T . Notice that, according to [36], a function F : [ 0 , 1 ] n [ 0 , 1 ] dominates a t-norm T with respect to a collection T = { T i } i = 1 n of t-norms when F satisfies, for all a , b [ 0 , 1 ] n , the following condition:
T ( F ( a ) , F ( b ) ) F ( T 1 ( a 1 , b 1 ) , , T n ( a n , b n ) ) .
Motivated by the fact that, on the one hand, the exposed relationship of duality between relaxed indistinguishability fuzzy relations and relaxed pseudo-metrics and, on the other hand, the possibility of expressing the equivalence provided by Theorem 8 in terms of new ones for functions aggregating relaxed pseudo-metrics in the spirit of Theorems 6 and 7 is not explored yet, the main purpose of this paper is to study the connection between those functions that aggregate relaxed indistinguishability fuzzy relations with respect to a collection of t-norms and those functions that merge relaxed pseudo-metrics complementing the information provided by Theorem 8 and extending, in some sense, Theorem 1 to the relaxed framework.
The remainder of the paper is organized as follows. In Section 2, we provide a new characterization of those functions that aggregate relaxed indistinguishability fuzzy relations. Thus, we show that there is an equivalence between functions that aggregate T -relaxed indistinguishability fuzzy relations and those functions aggregating relaxed pseudo-metrics. Moreover, such an equivalence is expressed in terms of triangular triplets in the spirit of Theorem 2. An interesting consequence that can be derived from the aforementioned equivalence is that the functions under consideration are in correspondence with those that are subaddtive. Moreover, the separating points case is approached and characterizations of the class of functions merging T -relaxed indistinguishability fuzzy relations that separate points are obtained in terms of T -triangular triplets. It must be pointed out that the aggregation of this type of relaxed indistinguishability fuzzy relations was not explored in [36]. Outstanding differences between those functions aggregating T -relaxed indistinguishability fuzzy relations and those that aggregate their counterpart separating points are shown.
Special attention is paid to the distinguished class of S S I - T -relaxed indistinguishability fuzzy relations in Section 3. Thus, we show that functions merging this special type of relaxed indistinguishability fuzzy relations can be expressed through functions aggregating S S D -relaxed pseudo-metrics. It must be stressed that there is a notable difference between the class of functions that are able to aggregate a collection of relaxed indistinguishability fuzzy relations (relaxed pseudo-metrics) and S S I -relaxed indistinguishability fuzzy relations ( S S D -relaxed pseudo-metric). In this case, the appropriate class of functions are those that satisfy monotony and subadditivity. Section 4 ends the paper, exposing the conclusions and future work.

2. Aggregation of T -Relaxed Indistinguishability Relations

In this subsection, we focus our efforts on the study of the interlink between those functions that aggregate relaxed indistinguishability fuzzy relations with respect to a collection of t-norms T and those functions that merge relaxed pseudo-metrics in such a way that the information provided by Theorem 8 is complemented, and an extension of Theorem 6 to the relaxed context is obtained. Moreover, the case in which the relaxed indistinguishability fuzzy relations separate points is also explored and a version of Theorems 5 and 7 in the new framework is proved.
With the aim of stating the aforesaid link, we prove the following result that will be useful later on.
Lemma 1.
Let n N and let a , b , c [ 0 , + ] n . If ( a , b , c ) is an n-dimensional triangular triplet and X = { x , y , z } with c a r d ( X ) = 3 , then there exists a collection { d i } i = 1 n of relaxed pseudo-metrics on X such that d i ( x , y ) = a i , d i ( x , z ) = b i and d i ( z , y ) = c i for all i = 1 , , n .
Proof. 
Define, for each i { 1 , , n } , the function d i : X × X [ 0 , + ] by d i ( x , y ) = d i ( y , x ) = a i , d i ( x , z ) = d i ( z , x ) = b i and d i ( z , y ) = d i ( y , z ) = c i . Clearly d i ( u , v ) = d i ( v , u ) for all u , v X and for all i { 1 , , n } . Moreover, d i ( u , v ) d i ( u , w ) + d i ( w , v ) for all u , v , w X and for all i { 1 , , n } , since ( a , b , c ) is an n-dimensional triangular triplet. So { d i } i = 1 n is a collection of relaxed pseudo-metrics on X. □
The next result provides a sequence of equivalences revealing the aforementioned interlink.
Theorem 9.
Let n N , let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms, and let { f T i } i = 1 n be a collection of additive generators of T . If T is a continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -relaxed indistinguishability fuzzy relations into a T-relaxed indistinguishability fuzzy relation.
(2) 
F transforms n-dimensional T -triangular triplets into a one-dimensional T-triangular triplet.
(3) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] transforms n-dimensional triangular triplets into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] , where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(4) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of relaxed pseudo-metrics into an f T ( 0 ) -bounded relaxed pseudo-metric, where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(5) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded relaxed pseudo-metrics into an f T ( 0 ) -bounded relaxed pseudo-metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
(6) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] , where H = f T F ( f T 1 1 × × f T n 1 ) .
Proof. 
( 1 ) ( 2 ) . This implication is warranted by Theorem 8.
( 2 ) ( 3 ) . Let ( a , b , c ) , with a , b , c [ 0 , + ] n , be an n-dimensional triangular triplet. Then
f T i ( 1 ) ( u i ) f T i ( 1 ) ( v i + w i ) T i ( f T i ( 1 ) ( v i ) , f T i ( 1 ) ( w i ) )
for all i { 1 , , n } and for all u , v , w { a , b , c } . So ( α , β , γ ) [ 0 , 1 ] n forms an n-dimensional T -triangular triplet, where α = ( f T 1 ( 1 ) ( a 1 ) , , f T n ( 1 ) ( a n ) ) , β = ( f T 1 ( 1 ) ( b 1 ) , , f T n ( 1 ) ( b n ) ) and γ = ( f T 1 ( 1 ) ( c 1 ) , , f T n ( 1 ) ( c n ) ) . Thus, ( F ( α ) , F ( β ) , F ( γ ) ) is a one-dimensional T-triangular triplet. It follows that
f T F ( u ) f T T ( F ( v ) , F ( w ) ) = f T f T ( 1 ) ( f T F ( v ) + f T F ( w ) )
for all u , v , w { α , β , γ } . Then
f T F ( u ) f T F ( v ) + f T F ( w )
for all u , v , w { α , β , γ } , since
f T f T ( 1 ) ( f T F ( v ) + f T F ( w ) ) f T F ( v ) + f T F ( w )
for all u , v , w { α , β , γ } . Therefore
f T F ( f T 1 ( 1 ) ( u 1 ) × × f T n ( 1 ) ( u n ) ) f T F ( f T 1 ( 1 ) ( v 1 ) × × f T n ( 1 ) ( v n ) ) + f T F ( f T 1 ( 1 ) ( w 1 ) × × f T n ( 1 ) ( w n ) )
for all u , v , w { a , b , c } . Whence we conclude that ( G ( a ) , G ( b ) , G ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
( 3 ) ( 4 ) . Consider a collection { d i } i = 1 n of relaxed pseudo-metrics on a non-empty set X. Symmetry is clear, since G ( d 1 , , d n ) ( x , y ) = G ( d 1 , , d n ) ( y , x ) . The fact that { d i } i = 1 n are relaxed pseudo-metrics on X gives that, for every x , y , z X , we have that ( d , e , f ) [ 0 , ] n is an n-dimensional triangular triplet, where d = ( d 1 ( x , y ) , , d n ( x , y ) ) , e = ( d 1 ( x , z ) , , d n ( x , z ) ) and f = ( d 1 ( z , y ) , , d n ( z , y ) ) . Then ( G ( d ) , G ( e ) , G ( f ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] . Whence we have that
G ( d 1 , , d n ) ( u , v ) G ( d 1 , , d n ) ( u , w ) + G ( d 1 , , d n ) ( w , v )
for all u , v , w { x , y , z } . Moreover, G ( d 1 , , d n ) ( u , v ) f T ( 0 ) for all u , v { x , y , z } . Therefore, G ( d 1 , , d n ) is an f T ( 0 ) -bounded relaxed pseudo-metric on X.
( 4 ) ( 5 ) . It is obvious.
( 5 ) ( 6 ) . Consider an n-dimensional triangular triplet ( a , b , c ) in i = 1 n [ 0 , f T i ( 0 ) ] . Set X = { x , y , z } with c a r d ( X ) = 3 . By Lemma 1, which remains valid for bounded n-dimensional triangular triplets, we have that there exists a collection of ( f T i ( 0 ) ) i = 1 n -bounded relaxed pseudo-metrics on X such that d i ( x , y ) = a i , d i ( x , z ) = b i and d i ( z , y ) = c i for all i = 1 , , n . Then H ( d 1 , , d n ) is a f T ( 0 ) -bounded relaxed pseudo-metric on X. Thus,
H ( d 1 , , d n ) ( u , v ) H ( d 1 , , d n ) ( u , w ) + H ( d 1 , , d n ) ( w , v )
for all u , v , w X . It follows that H ( a ) H ( b ) + H ( c ) , H ( b ) H ( a ) + H ( c ) and H ( c ) H ( a ) + H ( b ) , where H ( a ) = H ( d 1 ( x , y ) , , d n ( x , y ) ) , H ( b ) = H ( d 1 ( x , z ) , , d n ( x , z ) ) and H ( c ) = H ( d 1 ( z , y ) , , d n ( z , y ) ) . Whence we obtain that ( H ( a ) , H ( b ) , H ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
( 6 ) ( 1 ) . Consider a collection { E i } i = 1 n of T -relaxed indistinguishability fuzzy relations on a non-empty set X.
Next, consider x , y , z X . We need to show that
F ( E 1 , , E n ) ( u , v ) T ( F ( E 1 , , E n ) ( u , w ) , F ( E 1 , , E n ) ( w , v ) )
for all u , v , w { x , y , z } . To this end, set a i = f T i ( E i ( x , y ) ) , b i = f T i ( E i ( y , z ) ) , and c i = f T i ( E i ( x , z ) ) . We know that T i ( E i ( u , w ) , E i ( w , v ) ) E i ( u , v ) for all u , v , w { x , y , z } . From this fact, we can infer that a i + b i c i , b i + c i a i and c i + a i b i for all i = 1 , , n . Next, we only show that a i + b i c i for all i = 1 , , n . The remainder inequalities can de derived following similar arguments. From the fact that T i ( E i ( x , y ) , E i ( y , z ) ) E i ( x , z ) for all i = 1 , , n we obtain that
f T i ( 1 ) f T i ( E i ( x , y ) ) + f T i ( E i ( y , z ) ) E i ( x , z )
for all i = 1 , , n . Then f T i ( 1 ) a i + b i f T i ( 1 ) ( c i ) = f T i 1 ( c i ) for all i = 1 , , n . It follows that f T i f T i ( 1 ) a i + b i c i for all i = 1 , , n . Since a i + b i f T i f T i ( 1 ) a i + b i , we deduce that a i + b i c i for all i = 1 , , n .
Consequently, we have that ( a , b , c ) is an n-dimensional triangular triplet in i = 1 n [ 0 , f T i ( 0 ) ] . So ( H ( a ) , H ( b ) , H ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] . Thus, H ( a ) H ( b ) + H ( c ) , H ( b ) H ( a ) + H ( c ) and H ( c ) H ( a ) + H ( b ) . From the preceding inequalities, we can obtain that
F ( E 1 , , E n ) ( u , v ) T ( F ( E 1 , , E n ) ( u , w ) , F ( E 1 , , E n ) ( w , v ) )
for all u , v , w { x , y , z } . We only show that
F ( E 1 , , E n ) ( x , y ) T ( F ( E 1 , , E n ) ( x , z ) , F ( E 1 , , E n ) ( z , y ) )
because the the same reasoning can be applied to prove the two remainder cases. Since H ( a ) H ( b ) + H ( c ) , we deduce that
f T F ( f T 1 1 ( a 1 ) × × f T n 1 ( a n ) ) f T F ( f T 1 1 ( b 1 ) × × f T n 1 ( b n ) ) + f T F ( f T 1 1 ( c 1 ) × × f T n 1 ( c n ) ) .
Hence we obtain that
F ( f T 1 1 ( a 1 ) × × f T n 1 ( a n ) ) = f T ( 1 ) f T F ( f T 1 1 ( a 1 ) × × f T n 1 ( a n ) ) f T ( 1 ) f T F ( f T 1 1 ( b 1 ) × × f T n 1 ( b n ) ) + f T F ( f T 1 1 ( c 1 ) × × f T n 1 ( c n ) ) = T ( F ( f T 1 1 ( b 1 ) × × f T n 1 ( b n ) ) , F ( f T 1 1 ( c 1 ) × × f T n 1 ( c n ) ) ) .
Hence we conclude that
F ( E 1 , , E n ) ( x , y ) T ( F ( E 1 , , E n ) ( x , z ) , F ( E 1 , , E n ) ( z , y ) ) .
Therefore, F ( E 1 , , E n ) fulfills condition ( R 2 ) . Clearly, F ( E 1 , , E n ) ( u , v ) = F ( E 1 , , E n ) ( v , u ) for all u , v X . Therefore, F ( E 1 , , E n ) is a T -relaxed indistinguishability fuzzy relation on X as claimed. □
For strict continuous Archimedean t-norms, we have from Theorem 9 the following result.
Corollary 2.
Let n N and let T = { T i } i = 1 n be a collection of strict continuous Archimedean t-norms. If T is a strict continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -relaxed indistinguishability fuzzy relations into a T-relaxed indistinguishability fuzzy relation.
(2) 
F transforms n-dimensional T -triangular triplets into a one-dimensional T-triangular triplet.
(3) 
The function G : [ 0 , + ] n [ 0 , + ] transforms n-dimensional triangular triplets into a one-dimensional triangular triplet, where G = f T F ( f T 1 1 × × f T n 1 ) .
(4) 
The function G : [ 0 , + ] n [ 0 , + ] aggregates every collection { d i } i = 1 n of relaxed pseudo-metrics into a relaxed pseudo-metric, where G = f T F ( f T 1 1 × × f T n 1 ) .
The next result, which will be useful in our subsequent discussion, gives information about those functions that transform n-dimensional triangular triplets into a one-dimensional triangular triplet (see [19] [Proposition 7]). In order to introduce it, let us recall that, given s [ 0 , ] , a function G : [ 0 , + ] n [ 0 , s ] is subadditive provided that G ( a + b ) G ( a ) + G ( b ) for all a , b [ 0 , + ] n .
Proposition 1.
Let n N and let T be a continuous Archimedean t-norm with an additive generator f T . If a function G : [ 0 , ] n [ 0 , f T ( 0 ) ] transforms n-dimensional triangular triplets into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] , then it is subadditive.
In light of Proposition 1 and Theorem 9, we obtain the next result.
Corollary 3.
Let n N and let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms, and let { f T i } i = 1 n be a collection of additive generators of T . If T is a continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] aggregates T -relaxed indistinguishability fuzzy relations into a T-relaxed indistinguishability fuzzy relation, then the function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] is subaddtitve, where G = f T F f T 1 ( 1 ) × × f T n ( 1 ) .
In [36], the aggregation of relaxed indistinguishability fuzzy relations that separate points was not explored. Taking this fact into account, we obtain a characterization of those functions that are able to aggregate this type of T -relaxed indistinguishability fuzzy relations extending Theorem 7 to the relaxed context and expanding the information provided about relaxed indistinguishability fuzzy relations in the aforementioned reference, and in addition, we give relationships between these functions and those that transform T -triangle triplets and those that aggregate relaxed metrics. Outstanding differences between this class of functions and the class of functions aggregating T -relaxed indistinguishability fuzzy relations are shown.
Theorem 10.
Let n N , let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms, and let { f T i } i = 1 n be a collection of additive generators of T . If T is a continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -relaxed indistinguishability fuzzy relations that separate points into a T-relaxed indistinguishability fuzzy relation that separates points.
(2) 
F satisfies the following conditions:
(2.1) 
If a , b , c [ 0 , 1 ] n such that T i ( a i , a i ) b i and T i ( a i , a i ) c i for all i = 1 , , n with a i [ 0 , 1 [ for all i = 1 , , n and F ( a ) = F ( b ) = F ( c ) , then there exists i { 1 , , n } such that a i = b i = c i .
(2.2) 
If a , b , c [ 0 , 1 [ n such that ( a , b , c ) is an n-dimensional T -triangular triplet, then ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet.
(3) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] , where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) , satisfies the following assertions:
(3.1) 
If a , b , c i = 1 n [ 0 , f T i ( 0 ) ] such that f T i ( 1 ) ( a i + a i ) f T i ( 1 ) ( b i ) and f T i ( 1 ) ( a i + a i ) f T i ( 1 ) ( c i ) for all i = 1 , , n with a i ] 0 , f T i ( 0 ) ] for all i = 1 , , n and G ( a ) = G ( b ) = G ( c ) , then there exists i { 1 , , n } such that a i = b i = c i .
(3.2) 
G transforms n-dimensional triangular triplets in [ 0 , + ] n into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
(4) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics into an f T ( 0 ) -bounded relaxed metric, where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(5) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics into an f T ( 0 ) -bounded relaxed metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
(6) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] , where H = f T F ( f T 1 1 × × f T n 1 ) , satisfies the following conditions:
(6.1) 
If a , b , c i = 1 n [ 0 , f T i ( 0 ) ] such that b i a i + a i and c i a i + a i with a i ] 0 , f T i ( 0 ) ] for all i = 1 , , n and H ( a ) = H ( b ) = H ( c ) , then there exists i { 1 , , n } such that a i = b i = c i .
(6.2) 
H transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
Proof. 
( 1 ) ( 2 ) . First we prove that ( 2.1 ) holds. Suppose that a , b , c [ 0 , 1 ] n such that T i ( a i , a i ) b i and T i ( a i , a i ) c i for all i = 1 , , n with a i [ 0 , 1 ] for all i = 1 , , n and F ( a ) = F ( b ) = F ( c ) . For the purpose of contradiction, we assume that for all i { 1 , , n } we have that a i , b i , c i are not equal, since otherwise we have the desired conclusion. Then consider the non-empty set X = { x , y } with x , y different. Define on X the collection { E i } i = 1 n of T -relaxed indistinguishability fuzzy relations that separate points as follows: E i ( x , y ) = E i ( y , x ) = a i and E i ( x , x ) = b i and E i ( y , y ) = c i for all i = 1 , , n . Since F aggregates T -relaxed indistinguishability fuzzy relations that separate points into a T-relaxed indistinguishability fuzzy relation that separates points, we find that F ( E 1 , , E n ) is a T-relaxed indistinguishability fuzzy relation that separates points. Moreover, F ( a ) = F ( b ) = F ( c ) and, thus F ( E 1 , , E n ) ( x , y ) = F ( E 1 , , E n ) ( x , x ) = F ( E 1 , , E n ) ( y , y ) . So x = y which is a contradiction.
Next, we prove ( 2.2 ) . With this aim, we assume that ( a , b , c ) , with a , b , c [ 0 , 1 ] n , is a T -triangular triplet. Consider a set X = { x , y , z } with c a r d ( X ) = 3 . Define the collection of fuzzy binary relations { E i } i = 1 n on X given by a i = E i ( x , y ) = E i ( y , x ) , b i = E i ( y , z ) = E i ( z , y ) , c i = E i ( x , z ) = E i ( z , x ) and E i ( x , x ) = E i ( y , y ) = E i ( z , z ) = 1 for all i = 1 , , n . Then { E i } i = 1 n is a collection of T -relaxed indistinguishability fuzzy relations that separate points on X. So F ( E 1 , , E n ) is a T-relaxed indistinguishability fuzzy relation that separates points on X. Whence we deduce, by R 2 ) that T ( F ( a ) , F ( b ) ) F ( c ) , T ( F ( a ) , F ( c ) ) F ( b ) , and T ( F ( a ) , F ( b ) ) F ( c ) . Therefore, we conclude that ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet.
( 2 ) ( 1 ) . Let X be a non-empty set and let { E i } i = 1 n be a collection of T -relaxed indistinguishability fuzzy relations that separate points on X. Set x , y , z X and assume that F ( E 1 , , E n ) ( x , y ) = F ( E 1 , , E n ) ( x , x ) = F ( E 1 , , E n ) ( y , y ) . Take a i = E i ( x , y ) , b i = E i ( x , x ) and c i = E i ( y , y ) for all i = 1 , , n . Then a , b , c [ 0 , 1 ] n , T i ( a i , a i ) b i and T i ( a i , a i ) c i for all i = 1 , , n . Observe that we can suppose that a i [ 0 , 1 ] because if a i = 1 for any i { 1 , , n } we obtain that E i ( x , y ) = 1 and, hence, E i ( x , x ) = E i ( y , y ) = 1 and, as a consequence, that x = y . The fact that F ( E 1 , , E n ) ( x , y ) = F ( E 1 , , E n ) ( x , x ) = F ( E 1 , , E n ) ( y , y ) gives that F ( a ) = F ( b ) = F ( c ) . Whence we deduce, by 2.1 ) , that there exists i { 1 , , n } such that a i = b i = c i . So E i ( x , y ) = E i ( x , x ) = E i ( y , y ) and x = y .
In the following, we show that
T ( F ( E 1 , , E n ) ( u , v ) , F ( E 1 , , E n ) ( v , w ) ) F ( E 1 , , E n ) ( u , w )
for all u , v , w { x , y , z } . Of course, we can assume that x , y , z are all different elements, since otherwise the preceding inequality is held immediately. So E i ( x , y ) , E i ( y , z ) , E i ( x , z ) [ 0 , 1 [ . Now set a i = E i ( x , y ) , b i = E i ( y , z ) and c i = E i ( x , z ) for all i = 1 , , n . Then ( a , b , c ) is a T -triangular triplet. It follows, from ( 2.2 ) , that ( F ( a ) , F ( b ) , F ( c ) ) is a T-triangular triplet, and the above inequality is satisfied.
( 2 ) ( 3 ) . Assume that a , b , c i = 1 n [ 0 , f T i ( 0 ) ] such that f T i ( 1 ) ( a i + a i ) f T i ( 1 ) ( b i ) and f T i ( 1 ) ( a i + a i ) f T i ( 1 ) ( c i ) for all i = 1 , , n with a i ] 0 , f T i ( 0 ) ] for all i = 1 , , n and G ( a ) = G ( b ) = G ( c ) . Set d = ( f T 1 ( 1 ) ( a 1 ) , , f T 1 ( 1 ) ( a 1 ) ) , e = ( f T 1 ( 1 ) ( b 1 ) , , f T 1 ( 1 ) ( b 1 ) ) and, in addition, g = ( f T 1 ( 1 ) ( c 1 ) , , f T 1 ( 1 ) ( c 1 ) ) . Clearly, d , e , g [ 0 , 1 ] n . Since a i ] 0 , f T i ( 0 ) ] for all i = 1 , , n , we have that d [ 0 , 1 [ n . Moreover, T i ( d i , d i ) e i for all i = 1 , , n , since
T i ( d i , d i ) = T i ( f T i ( 1 ) ( a i ) , f T i ( 1 ) ( a i ) ) =
f T i ( 1 ) f T i ( f T i ( 1 ) ( a i ) ) + f T i ( f T i ( 1 ) ( a i ) ) = f T i ( 1 ) ( a i + a i ) f T i ( 1 ) ( b i ) = e i .
Following the same arguments, we show that T i ( d i , d i ) g i for all i = 1 , , n .
The fact that G ( a ) = G ( b ) = G ( c ) gives that f T ( F ( d ) ) = f T ( F ( e ) ) = f T ( F ( g ) ) . Since f T is injective, by ( 2.1 ) , we deduce that F ( d ) = F ( e ) = F ( g ) . So there exists i { 1 , , n } such that d i = e i = g i . Whence we deduce that f T i ( 1 ) ( a i ) = f T i ( 1 ) ( b i ) = f T i ( 1 ) ( c i ) . Therefore, we obtain that a i = b i = c i because f T i ( 1 ) | [ 0 , f T i ( 0 ) ] = f T i 1 and f T i 1 is injective on f T i ( [ 0 , 1 ] ) (notice that f T i is continuous).
Next, consider an n-dimensional triangular triplet ( a , b , c ) in [ 0 , + ] n . Then u i v i + w i for all i = 1 , , n and for all u , v , w { a , b , c } . Thus,
f T i ( 1 ) ( u i ) f T i ( 1 ) ( v i + w i ) T i ( f T i ( 1 ) ( v i ) , f T i ( 1 ) ( w i ) )
for all u , v , w { a , b , c } . Whence we deduce that ( f T i ( 1 ) ( a i ) , f T i ( 1 ) ( b i ) , f T i ( 1 ) ( c i ) ) is a T i -triangular triplet. So ( d , e , f ) [ 0 , 1 [ n is an n-dimensional T -triangular triplet with d = ( f T 1 ( 1 ) ( a 1 ) , , f T n ( 1 ) ( a n ) ) , e = ( f T 1 ( 1 ) ( b 1 ) , , f T n ( 1 ) ( b n ) ) and f = ( f T 1 ( 1 ) ( c 1 ) , , f T n ( 1 ) ( c n ) ) . Then, by ( 2.2 ) , ( F ( d ) , F ( e ) , F ( f ) ) is a one-dimensional T-triangular triplet. Hence we have that
T ( F ( u ) , F ( w ) ) F ( v )
for all u , v , w { d , e , f } . Whence we deduce that
f T ( 1 ) f T F ( u ) + f T F ( w ) = T ( F ( u ) , F ( w ) ) F ( v )
for all u , v , w { d , e , f } . Thus, we obtain
G ( u ) + G ( w ) = f T F ( u ) + f T F ( w )
f T f T ( 1 ) f T F ( u ) + f T F ( w ) f T F ( v ) = G ( v ) .
for all u , v , w { a , b , c } . Therefore, ( G ( a ) , G ( b ) , G ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
( 3 ) ( 4 ) . Consider a collection { d i } i = 1 n of ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics on a non-empty set X. We show that G ( d 1 , , d n ) is a f T ( 0 ) -bounded relaxed metric on X.
Suppose that
G ( d 1 , , d n ) ( x , y ) = G ( d 1 , , d n ) ( x , x ) = G ( d 1 , , d n ) ( y , y )
for any x , y X . We can assume that d i ( x , y ) ] 0 , f T i ( 0 ) ] because otherwise we have that d i ( x , y ) = d i ( x , x ) = d i ( y , y ) = 0 and, thus, that x = y .
Since, for any x , y X , d i ( x , y ) , d i ( x , x ) [ 0 , f T i ( 0 ) ] for all i = 1 , , n and, in addition, d i ( x , x ) d i ( x , y ) + d i ( y , x ) we obtain
f T i ( 1 ) ( d i ( x , y ) + d i ( x , y ) ) f T i ( 1 ) ( d i ( x , x ) )
for all i = 1 , , n . Similarly, we obtain
f T i ( 1 ) ( d i ( x , y ) + d i ( x , y ) ) f T i ( 1 ) ( d i ( y , y ) )
for all i = 1 , , n . Set a = ( d 1 ( x , y ) , , d n ( x , y ) ) , b = ( d 1 ( x , x ) , , d n ( x , x ) ) and c = ( d 1 ( y , y ) , , d n ( y , y ) ) . Then G ( a ) = G ( b ) = G ( c ) . So there exists i { 1 , , n } such that a i = b i = c i . Thus, d i ( x , y ) = d i ( x , x ) = d i ( y , y ) , and hence, x = y .
Clearly, G ( d 1 , , d n ) ( x , y ) = G ( d 1 , , d n ) ( y , x ) for all x , y X .
Finally, we prove that the triangle inequality
G ( d 1 , , d n ) ( x , z ) G ( d 1 , , d n ) ( x , y ) + G ( d 1 , , d n ) ( y , z )
is held for each x , y , z X . Observe that without loss of generality we can check the triangle inequality only for elements x , y , z X with u v for all u , v { x , y , z } , and thus, we can assume that the cardinality of X is at least three. Otherwise, the triangle inequality is clearly satisfied.
By hypothesis, we have that d i ( u , v ) 0 for all u , v { x , y , z } and for all i = 1 , , n . Otherwise, if there exists i { 1 , , n } such that d i ( u , v ) = 0 for some u , v { x , y , z } with u v , then d i ( u , u ) = d i ( v , v ) = 0 and u = v , which is not possible.
Define a = ( d 1 ( x , z ) , d 2 ( x , z ) , , d n ( x , z ) ) , b = ( d 1 ( x , y ) , d 2 ( x , y ) , , d n ( x , y ) ) and c = ( d 1 ( y , z ) , d 2 ( y , z ) , , d n ( y , z ) ) . By our assumptions, ( a , b , c ) , with a , b , c i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , + ] n , is an n-dimensional triangular triplet. This gives, by ( 3.2 ) , that ( G ( a ) , G ( b ) , G ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] . It follows that
G ( d 1 , , d n ) ( u , v )
G ( d 1 , , d n ) ( u , w ) + G ( d 1 , , d n ) ( w , v )
for all u , v , w { x , y , z } .
( 4 ) ( 5 ) . It is obvious.
( 5 ) ( 6 ) . We first prove ( 6.1 ) . Let a , b , c i = 1 n [ 0 , f T i ( 0 ) ] such that b i a i + a i and c i a i + a i with a i ] 0 , f T i ( 0 ) ] for all i = 1 , , n and H ( a ) = H ( b ) = H ( c ) . For the purpose of contradiction, we assume that { a i , b i , c i } are not equal for all i = 1 , , n .
Set X = { x , y } with x , y different. Define the function d i : X × X [ 0 , f T i ( 0 ) ] by d i ( x , y ) = d i ( y , x ) = a i and d i ( x , x ) = b i and d i ( y , y ) = c i for all i = 1 , , n . Then { d i } i = 1 n is a collection of ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics on X. Thus, H ( d 1 , , d n ) is an f T ( 0 ) -bounded relaxed metric on X. Since H ( a ) = H ( b ) = H ( c ) , we have that
H ( d 1 , , d n ) ( x , y ) = H ( d 1 , , d n ) ( x , x ) = H ( d 1 , , d n ) ( y , y ) ,
which is impossible because x y . Therefore, there exists i { 1 , , n } such that a i = b i = c i .
In the following, we prove ( 6.2 ) . Consider an n-dimensional triangular triplet ( a , b , c ) with a , b , c i = 1 n [ 0 , f T i ( 0 ) ] . Set X = { x , y , z } with c a r d ( X ) = 3 . Define, for each i { 1 , , n } , the function d i : X × X [ 0 , + ] by d i ( x , y ) = d i ( y , x ) = a i , d i ( x , z ) = d i ( z , x ) = b i , d i ( z , y ) = d i ( y , z ) = c i and d i ( x , x ) = d i ( y , y ) = d i ( z , z ) = 0 . It is not hard to check that { d i } i = 1 n is a collection of ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics on X. Then H ( d 1 , , d n ) is an f T ( 0 ) -bounded relaxed metric on X. Whence we deduce that
H ( d 1 , , d n ) ( u , v ) H ( d 1 , , d n ) ( u , w ) + H ( d 1 , , d n ) ( w , v )
for all u , v , w { x , y , z } . It follows that ( H ( a ) , H ( b ) , H ( c ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
( 6 ) ( 2 ) . Next, we prove ( 2.1 ) . Let a , b , c [ 0 , 1 ] n such that T i ( a i , a i ) b i and T i ( a i , a i ) c i for all i = 1 , , n with a i [ 0 , 1 [ for all i = 1 , , n . The fact that T i ( a i , a i ) b i gives that f T i ( 1 ) ( f T i ( a i ) + f T i ( a i ) ) b i . Thus, we obtain, for all i = 1 , , n , that
f T i ( b i ) f T i f T i ( 1 ) ( f T i ( a i ) + f T i ( a i ) ) f T i ( a i ) + f T i ( a i ) .
Following the same arguments, we obtain that f T i ( c i ) f T i ( a i ) + f T i ( a i ) .
Put g , s , r i = 1 n [ 0 , f T i ( 0 ) ] given by
g i = f T i ( a i ) , s i = f T i ( b i ) , r i = f T i ( c i )
for all i = 1 , , n . Clearly, g i [ 0 , f T i ( 0 ) ] because, for any i { 1 , , n } , g i = 0 a i = 1 . Moreover, we have that s i g i + g i and r i g i + g i for all i = 1 , , n .
Observe that H ( g ) = f T F ( a ) , H ( s ) = f T F ( b ) and H ( r ) = f T F ( c ) . Suppose that F ( a ) = F ( b ) = F ( c ) . Then H ( g ) = H ( r ) = H ( s ) , and thus, there exists i { 1 , , n } with g i = r i = s i . It follows that f T i ( a i ) = f T i ( b i ) = f T i ( c i ) . The injectivity of f T provides that a i = b i = c i , as claimed.
Finally, we prove ( 2.2 ) . Let a , b , c [ 0 , 1 ] n such that ( a , b , c ) is an n-dimensional T -triangular triplet. Then ( e , f , g ) is an n-dimensional triangular triplet in i = 1 n [ 0 , f T i ( 0 ) ] , where e = ( f T 1 ( a 1 ) , , f T n ( a n ) ) , f = ( f T 1 ( b 1 ) , , f T n ( b n ) ) and g = ( f T 1 ( c 1 ) , , f T n ( c n ) ) . Indeed, we have that T i ( u i , v i ) w i for all i = 1 , , n and for all u , v , w { a , b , c } . Hence we obtain that
f T i ( 1 ) f T i ( u i ) + f T i ( v i ) w i
for all i = 1 , , n and for all u , v , w { a , b , c } . Whence we deduce that
f T i f T i ( 1 ) f T i ( u i ) + f T i ( v i ) f T i ( w i )
for all i = 1 , , n and for all u , v , w { a , b , c } . Since
f T i ( u i ) + f T i ( v i ) f T i f T i ( 1 ) f T i ( u i ) + f T i ( v i )
we deduce that
f T i ( u i ) + f T i ( v i ) f T i ( w i )
for all i = 1 , , n and for all u , v , w { a , b , c } . Consequently, ( H ( e ) , H ( f ) , H ( g ) ) is a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] . Thus,
f T F ( u 1 , , u n ) f T F ( v 1 , , v n ) + f T F ( w 1 , , w n )
for all u , v , w { a , b , c } , since H ( e ) = f T F ( a 1 , , a n ) , H ( f ) = f T F ( b 1 , , b n ) and H ( g ) = f T F ( c 1 , , c n ) . Thus, we find that
f T ( 1 ) f T F ( u 1 , , u n ) f T ( 1 ) f T F ( v 1 , , v n ) + f T F ( w 1 , , w n )
for all u , v , w { a , b , c } . So we have that
F ( u ) = F ( u 1 , , u n ) f T ( 1 ) f T F ( v 1 , , v n ) + f T F ( w 1 , , w n ) = T ( F ( v ) , F ( w ) )
for all u , v , w { a , b , c } . Therefore, ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet. □
From the preceding result, we retrieve the following one when all t-norms under consideration are strict.
Corollary 4.
Let n N , let T = { T i } i = 1 n be a collection of strict continuous Archimedean t-norms, and let { f T i } i = 1 n be a collection of additive generators of T . If T is a strict continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates T -relaxed indistinguishability fuzzy relations that separate points into a T-relaxed indistinguishability fuzzy relation that separates points.
(2) 
F satisfies the following conditions:
(2.1) 
If a , b , c [ 0 , 1 ] n such that T i ( a i , a i ) b i and T i ( a i , a i ) c i for all i = 1 , , n with a i [ 0 , 1 ] for all i = 1 , , n and F ( a ) = F ( b ) = F ( c ) , then there exists i { 1 , , n } such that a i = b i = c i .
(2.2) 
If a , b , c [ 0 , 1 ] n such that ( a , b , c ) is an n-dimensional T -triangular triplet, then ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet.
(3) 
The function G : [ 0 , + ] n [ 0 , + ] , where G = f T F ( f T 1 1 × × f T n 1 ) , satisfies the following assertions:
(3.1) 
If a , b , c [ 0 , + ] such that f T i 1 ( a i + a i ) f T i 1 ( b i ) and f T i 1 ( a i + a i ) f T i 1 ( c i ) for all i = 1 , , n with a i ] 0 , + ] for all i = 1 , , n and G ( a ) = G ( b ) = G ( c ) , then there exists i { 1 , , n } such that a i = b i = c i .
(3.2) 
G transforms n-dimensional triangular triplets in [ 0 , + ] n into a one-dimensional triangular triplet in [ 0 , + ] .
(4) 
The function G : [ 0 , + ] n [ 0 , + ] aggregates every collection { d i } i = 1 n of relaxed metrics into a relaxed metric, where G = f T F ( f T 1 1 × × f T n 1 ) .
(5) 
The function H : [ 0 , + ] n [ 0 , + ] , where H = f T F ( f T 1 1 × × f T n 1 ) , satisfies the following conditions:
(5.1) 
If a , b , c [ 0 , + ] n such that b i a i + a i and c i a i + a i with a i [ 0 , + ] for all i = 1 , , n and H ( a ) = H ( b ) = H ( c ) , then there exists i { 1 , , n } such that a i = b i = c i .
(5.2) 
H transforms n-dimensional triangular triplets in [ 0 + ] n into a one-dimensional triangular triplet in [ 0 , + ] .

3. Aggregation of SSI- T -Relaxed Indistinguishability Relations

In this section, we focus our attention on the study of the distinguished class of S S I - T -relaxed indistinguishability fuzzy relations. Concretely, we show that functions merging this special type of relaxed indistinguishability fuzzy relations can be expressed through functions aggregating S S D -relaxed pseudo-metrics. It must be pointed out that there is a notable difference between the class of functions that are able to aggregate a collection of relaxed indistinguishability fuzzy relations (relaxed pseudo-metrics) and S S I -relaxed indistinguishability fuzzy relations ( S S D -relaxed pseudo-metrics). It must be stressed that S S I -relaxed indistinguishability fuzzy relations are known as weakly reflexive fuzzy relations in [51].
The next characterization was obtained for functions that aggregate S S I -relaxed indistinguishability fuzzy relations in [36] [Theorem 32]. Let us recall that a function G : [ 0 , s ] n [ 0 , s ] , s [ 0 , ] , is monotone when G ( a ) G ( b ) for all a , b [ 0 , s ] n with a i b i for all i = 1 , , n .
Theorem 11.
Let n N and let T = { T i } i = 1 n be a collection of t-norms. If T is a t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates SSI- T -relaxed indistinguishability fuzzy relations into an SSI-T-relaxed indistinguishability fuzzy relation.
(2) 
F holds the following conditions:
(2.1) 
F is monotone.
(2.2) 
F transforms n-dimensional T -triangular triplets into a one-dimensional T-triangular triplet.
In view of the preceding result, we introduce a few equivalences expressed in terms of functions aggregating S S D -relaxed pseudo-metrics and transforming T -triangle triplets. In order to state such equivalences, we need the next auxiliary result which was proved in [19] [Proposition 7].
Proposition 2.
Let n N and let T be a continuous Archimedean t-norm with an additive generator f T . If a function G : [ 0 , ] n [ 0 , f T ( 0 ) ] is monotone and subadditive, then it transforms n-dimensional triangular triplets into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
The promised equivalences are given in the result below.
Theorem 12.
Let n N , let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms, and let { f T i } i = 1 n be a collection of additive generators of T . If T is a continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates SSI- T -relaxed indistinguishability fuzzy relations into a SSI-T-relaxed indistinguishability fuzzy relation.
(2) 
F holds the following conditions:
(2.1) 
F is monotone.
(2.2) 
F transforms n-dimensional T -triangular triplets into a one-dimensional T-triangular triplet.
(3) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] is monotone and subadditive, where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(4) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] is monotone and transforms n-dimensional triangular triplets into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] , where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(5) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of SSD-relaxed pseudo-metrics into an SSD- f T ( 0 ) -bounded relaxed pseudo-metric, where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(6) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of SSD- ( f T i ( 0 ) ) i = 1 n -bounded relaxed pseudo-metrics into an SSD- f T ( 0 ) -bounded relaxed pseudo-metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
(7) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] is monotone and transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] , where H = f T F ( f T 1 1 × × f T n 1 ) ,
Proof. 
( 1 ) ( 2 ) . Theorem 11 guarantees such an implication.
( 2 ) ( 3 ) . Theorem 9 gives that condition ( 2.2 ) implies that G transforms n-dimensional triangular triplets into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] . Thus, by Proposition 1, we have that G is subadditive.
Next, we show that G is monotone provided that F is monotone. Indeed, consider a , b [ 0 , + ] n with a i b i for all i = 1 , , n . Then f T i ( 1 ) ( a i ) f T i ( 1 ) ( b i ) for all i = 1 , , n . Whence we have that
F ( f T 1 ( 1 ) ( a 1 ) × × f T n ( 1 ) ( a n ) ) F ( f T 1 ( 1 ) ( b 1 ) × × f T n ( 1 ) ( b n ) ) ,
since F is monotone. Hence
G ( a ) = f T F ( f T 1 ( 1 ) ( a 1 ) × × f T n ( 1 ) ( a n ) )
f T F ( f T 1 ( 1 ) ( b 1 ) × × f T n ( 1 ) ( b n ) = G ( b ) .
So G is monotone.
( 3 ) ( 4 ) . Proposition 2 gives that G transforms n-dimensional triangular triplets into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
( 4 ) ( 5 ) . The implication ( 3 ) ( 4 ) in Theorem 9 provides that the function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of relaxed pseudo-metrics on X into an f T ( 0 ) -bounded relaxed pseudo-metric on X. We only need to show that G aggregates SSD-relaxed pseudo-metrics into na SSD- f T ( 0 ) -bounded relaxed pseudo-metric.
Suppose that d i ( x , x ) d i ( x , y ) for all x , y X and for all i = 1 , , n . The monotony of G gives that
G ( d 1 ( x , x ) , , d n ( x , x ) ) G ( d 1 ( x , y ) , , d n ( x , y ) )
for all x , y X . So G ( d 1 , , d n ) is an SSD- f T ( 0 ) -bounded relaxed pseudo-metric on X.
( 5 ) ( 6 ) . It is obvious.
( 6 ) ( 7 ) . The proof of the fact that function H transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] is the same as that given for the implication ( 5 ) ( 6 ) in Theorem 9.
It remains to prove that H is monotone. With this aim, let a , b i = 1 n [ 0 , f T i ( 0 ) ] such that a i b i for all i = 1 , , n . Set X = { x , y } with x y . Define the the function d i : X × X [ 0 , f T i ( 0 ) ] by d i ( x , x ) = d i ( y , y ) = a i and d i ( x , y ) = d i ( y , x ) = b i for all i = 1 , , n . It is clear that { d i } i = 1 n is a collection of SSD- ( f T i ( 0 ) ) i = 1 n -bounded relaxed pseudo-metrics on X. Then H ( d 1 , , d n ) is an SSD- f T ( 0 ) -relaxed pseudo-metric on X. Hence H ( d 1 , , d n ) ( x , x ) H ( d 1 , , d n ) ( x , y ) . Then
H ( a ) = H ( d 1 ( x , x ) , , d n ( x , x ) ) = H ( d 1 , , d n ) ( x , x ) H ( d 1 , , d n ) ( x , y ) = H ( d 1 ( x , y ) , , d n ( x , y ) ) = H ( b ) .
Whence we deduce that H is monotone.
( 7 ) ( 1 ) . Suppose that { E i } i = 1 n is a collection of SSI- T -relaxed indistinguishability fuzzy relations on a non-empty set X. By ( 6 ) ( 1 ) in Theorem 9, we have that F ( E 1 , , E n ) is a T-relaxed indistinguishability fuzzy relation on X. Next, we show that F ( E 1 , , E n ) ( x , y ) F ( E 1 , , E n ) ( x , x ) for all x , y X . Since H is monotone and F = f T 1 H ( f T 1 × × f T n ) , we obtain that F is monotone. F ( E 1 , , E n ) ( x , y ) F ( E 1 , , E n ) ( x , x ) , since E i ( x , y ) E i ( x , x ) for all x , y X and for all i = 1 , , n . Hence we deduce that F ( E 1 , , E n ) is an SSI- T -relaxed indistinguishability fuzzy relation on X, which completes the proof. □
It is worth mentioning that, according to [36], the functions F that aggregate SSI- T -relaxed indistinguishability fuzzy relations into an SSI-T-relaxed indistinguishability fuzzy relation are exactly those that dominate the t-norm T with respect to T .
We can derive the next result from Theorem 12 for strict continuous Archimedean t-norms.
Corollary 5.
Let n N , and let T = { T i } i = 1 n be a collection of strict continuous Archimedean t-norms. If T is a strict continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates SSI- T -relaxed indistinguishability fuzzy relations into an SSI-T-relaxed indistinguishability fuzzy relation.
(2) 
F holds the following conditions:
(2.1) 
F is monotone.
(2.2) 
F transforms n-dimensional T -triangular triplets into a one-dimensional T-triangular triplet.
(3) 
The function G : [ 0 , + ] n [ 0 , + ] is monotone and subadditive, where G = f T F ( f T 1 1 × × f T n 1 ) .
(4) 
The function G : [ 0 , + ] n [ 0 , + ] is monotone and transforms n-dimensional triangular triplets into a one-dimensional triangular triplet, where G = f T F ( f T 1 1 × × f T n 1 ) .
(5) 
The function G : [ 0 , + ] n [ 0 , + ] aggregates every collection { d i } i = 1 n of SSD-relaxed pseudo-metrics into an SSD-relaxed pseudo-metric, where G = f T F ( f T 1 1 × × f T n 1 ) .
We end the section taking into consideration those functions that are able to aggregate S S I - T -relaxed indistinguishability fuzzy relations that separate points. We refer the reader to [43] [Example 3] for a non-trivial instance of an S S I -relaxed T-indistinguishability fuzzy relation that separates points.
Theorem 13.
Let n N , let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms, and let { f T i } i = 1 n be a collection of additive generators of T . If T is a continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates S S I - T -relaxed indistinguishability fuzzy relations that separate points into an S S I -T-relaxed indistinguishability fuzzy relation that separates points.
(2) 
F satisfies the following conditions:
(2.1) 
If a , b , c [ 0 , 1 ] n such that a i b i and a i c i for all i = 1 , , n and a i [ 0 , 1 ] for all i = 1 , , n and F ( a ) = F ( b ) = F ( c ) , then there exists i { 1 , , n } such that a i = b i = c i . Moreover, if for each i { 1 , , n } , either a i < b i or a i < c i , then F ( a ) F ( b ) and F ( a ) F ( c ) .
(2.2) 
If a , b , c [ 0 , 1 ] n such that ( a , b , c ) is an n-dimensional T -triangular triplet, then ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet.
(3) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] , where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) , satisfies the following assertions:
(3.1) 
Let a , b , c i = 1 n [ 0 , f T i ( 0 ) ] such that a i b i and a i c i for all i = 1 , , n with a i [ 0 , f T i ( 0 ) ] for all i = 1 , , n . If G ( a ) = G ( b ) = G ( c ) , then there exists i { 1 , , n } such that a i = b i = c i . Moreover, if for each i { 1 , , n } , either a i > b i or a i > c i , then G ( a ) G ( b ) and G ( a ) G ( c ) .
(3.2) 
G transforms n-dimensional triangular triplets in [ 0 , + ] n into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
(4) 
The function G : [ 0 , + ] n [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of S S D - ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics into an S S I - f T ( 0 ) -bounded relaxed metric, where G = f T F ( f T 1 ( 1 ) × × f T n ( 1 ) ) .
(5) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] aggregates every collection { d i } i = 1 n of S S D - ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics into a S S D - f T ( 0 ) -bounded relaxed metric, where H = f T F ( f T 1 1 × × f T n 1 ) .
(6) 
The function H : i = 1 n [ 0 , f T i ( 0 ) ] [ 0 , f T ( 0 ) ] , where H = f T F ( f T 1 1 × × f T n 1 ) , satisfies the following conditions:
(6.1) 
Let a , b , c i = 1 n [ 0 , f T i ( 0 ) ] such that a i c i and a i c i for all i = 1 , , n and a i ] 0 , f T i ( 0 ) ] for all i = 1 , , n with a i ] 0 , f T i ( 0 ) ] for all i = 1 , , n . If H ( a ) = H ( b ) = H ( c ) , then there exists i { 1 , , n } such that a i = b i = c i . Moreover, if for each i { 1 , , n } , either a i > b i or a i > c i , then H ( a ) H ( b ) and H ( a ) H ( c ) .
(6.2) 
H transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
Proof. 
( 1 ) ( 2 ) . Next, we prove ( 2.1 ) . Suppose that a , b , c [ 0 , 1 ] n such that a i b i and a i c i for all i = 1 , , n with a i [ 0 , 1 [ for all i = 1 , , n and F ( a ) = F ( b ) = F ( c ) . For the purpose of contradiction, we can assume that, for all i { 1 , , n } , we have that a i , b i , c i are not equal, since otherwise we have the desired conclusion. Consider the non-empty set X = { x , y } with x , y different. Define on X the collection { E i } i = 1 n of S S I - T -relaxed indistinguishability fuzzy relations that separate points as follows: E i ( x , y ) = E i ( y , x ) = a i , E i ( x , x ) = b i and E i ( y , y ) = c i for all i = 1 , , n . Since F aggregates S S I - T -relaxed indistinguishability fuzzy relations that separate points into an S S I -T-relaxed indistinguishability fuzzy relation that separates points we find that F ( E 1 , , E n ) is an S S I -T-relaxed indistinguishability fuzzy relation that separates points. Moreover, F ( a ) = F ( b ) = F ( c ) and, thus F ( E 1 , , E n ) ( x , y ) = F ( E 1 , , E n ) ( x , x ) = F ( E 1 , , E n ) ( y , y ) . So x = y which is impossible.
Now assume, in addition, that, for each i { 1 , , n } , either a i < b i or a i < c i . Again the collection { E i } i = 1 n of fuzzy relations defined above is a collection of S S I - T -relaxed indistinguishability fuzzy relations that separate points on the non-empty set X = { x , y } . The fact that F aggregates S S I - T -relaxed indistinguishability fuzzy relations that separate points into an S S I -T-relaxed indistinguishability fuzzy relation that separates points yields that F ( E 1 , , E n ) is a S S I -T-relaxed indistinguishability fuzzy relation that separates points. So F ( a ) = F ( E 1 , , E n ) ( x , y ) F ( E 1 , , E n ) ( x , x ) = F ( b ) and F ( a ) = F ( E 1 , , E n ) ( x , y ) F ( E 1 , , E n ) ( y , y ) = F ( c ) .
The same arguments to those given in the proof of ( 1 ) ( 2 ) in Theorem 10 remain valid in order to show ( 2.2 ) , i.e., ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet provided that a , b , c [ 0 , 1 ] n and ( a , b , c ) is an n-dimensional T -triangular triplet.
( 2 ) ( 3 ) . First we prove ( 3.1 ) . Assume that a , b , c i = 1 n [ 0 , f T i ( 0 ) ] such that a i b i and a i c i for all i = 1 , , n with a i [ 0 , f T i ( 0 ) ] for all i = 1 , , n and G ( a ) = G ( b ) = G ( c ) . Set d = ( f T 1 ( 1 ) ( a 1 ) , , f T 1 ( 1 ) ( a 1 ) ) , e = ( f T 1 ( 1 ) ( b 1 ) , , f T 1 ( 1 ) ( b 1 ) ) , g = ( f T 1 ( 1 ) ( c 1 ) , , f T 1 ( 1 ) ( c 1 ) ) . It is clear that d , e , g [ 0 , 1 ] n . Since a i [ 0 , f T i ( 0 ) ] for all i = 1 , , n we have that d [ 0 , 1 [ n . Moreover, d i e i and d i g i for all i = 1 , , n .
The fact that G ( a ) = G ( b ) = G ( c ) gives that f T ( F ( d ) ) = f T ( F ( e ) ) = f T ( F ( g ) ) . Since f T is injective we deduce that F ( d ) = F ( e ) = F ( g ) . So there exists i { 1 , , n } such that d i = e i = g i . Whence we deduce that f T i ( 1 ) ( a i ) = f T i ( 1 ) ( b i ) = f T i ( 1 ) ( c i ) . Since f T i ( 1 ) | [ 0 , f T i ( 0 ) ] = f T i 1 and f T i 1 is injective on f T i ( [ 0 , 1 ] ) we conclude that a i = b i = c i .
Suppose, in addition, that, for each i { 1 , , n } , either a i > b i or a i > c i . Then either f T i ( 1 ) ( a i ) = f T i 1 ( a i ) < f T i 1 ( b i ) = f T i ( 1 ) ( b i ) or f T i ( 1 ) ( a i ) = f T i 1 ( a i ) < f T i 1 ( c i ) = f T i ( 1 ) ( c i ) for each i = 1 , , n . It follows that
F ( f T i 1 ( a 1 ) , , f T i 1 ( a n ) ) F ( f T i 1 ( b 1 ) , , f T i 1 ( b n ) )
and
F ( f T i 1 ( a 1 ) , , f T i 1 ( a n ) ) F ( f T i 1 ( c 1 ) , , f T i 1 ( c n ) ) .
So G ( a ) = f T F ( f T i 1 ( a 1 ) , , f T i 1 ( a n ) ) G ( b ) = f T F ( f T i 1 ( b 1 ) , , f T i 1 ( b n ) ) and G ( a ) = f T F ( f T i 1 ( a 1 ) , , f T i 1 ( a n ) ) G ( c ) = f T F ( f T i 1 ( c 1 ) , , f T i 1 ( c n ) ) .
In order to prove ( 3.2 ) , the same arguments to those given in the proof of Theorem 10 provide that G transforms n-dimensional triangular triplets in [ 0 , + ] n into one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] .
( 3 ) ( 4 ) . Consider a collection { d i } i = 1 n of S S D - ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics on a non-empty set X. The same arguments to those given in Theorem 10 remain valid for showing fact that G ( d 1 , , d n ) satisfies the triangle inequality. Clearly G ( d 1 , , d n ) ( x , y ) = G ( d 1 , , d n ) ( y , x ) for all x , y X . Next, suppose that G ( d 1 , , d n ) ( x , y ) = G ( d 1 , , d n ) ( x , x ) = G ( d 1 , , d n ) ( y , y ) for any x , y X . Since d i ( x , x ) d i ( x , y ) and d i ( y , y ) d i ( x , y ) for all i = 1 , , n we have that there exists i { 1 , , n } such that d i ( x , y ) = d i ( x , x ) = d i ( y , y ) and, thus, x = y . Finally, we can assume that, for each i { 1 , , n } , either d i ( x , x ) < d i ( x , y ) either d i ( y , y ) < d i ( x , y ) . Then
G ( d 1 , , d n ) ( x , x ) G ( d 1 , , d n ) ( x , y )
and
G ( d 1 , , d n ) ( y , y ) G ( d 1 , , d n ) ( x , y ) .
( 4 ) ( 5 ) . It is obvious.
( 5 ) ( 6 ) . We prove ( 6.1 ) . Let a , b , c i = 1 n [ 0 , f T i ( 0 ) ] such that a i c i and b i c i for all i = 1 , , n and a i ] 0 , f T i ( 0 ) ] for all i = 1 , , n and H ( a ) = H ( b ) = H ( c ) . Next, for the purpose of contradiction assume that, for all i { 1 , , n } , the equality a i = b i = c i does not hold. It follows that there exists i { 1 , , n } such that either a i > c i or b i > c i .
Set X = { x , y } with x , y different. Define the function d i : X × X [ 0 , f T i ( 0 ) ] by d i ( x , y ) = d i ( y , x ) = a i , d i ( x , x ) = b i and d i ( y , y ) = c i for all i = 1 , , n . Then { d i } i = 1 n is a collection of S S D - ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics on X. Thus, H ( d 1 , , d n ) is an S S D - f T ( 0 ) -bounded relaxed metric on X. Since H ( a ) = H ( b ) = H ( c ) , we have that
H ( d 1 , , d n ) ( x , y ) = H ( d 1 , , d n ) ( x , x ) = H ( d 1 , , d n ) ( y , y ) ,
which is impossible because x y . Therefore, there exists i { 1 , , n } such that a i = b i = c i .
Moreover, assume for each i { 1 , , n } that either a i > b i or a i > c i . Then the above construction gives that { d i } i = 1 n is a collection of S S D - ( f T i ( 0 ) ) i = 1 n -bounded relaxed metrics on X. So
H ( b ) = H ( d 1 , , d n ) ( x , x ) H ( d 1 , , d n ) ( x , y ) = H ( a )
and
H ( c ) = H ( d 1 , , d n ) ( y , y ) H ( d 1 , , d n ) ( y , y ) = H ( a ) .
The proof of ( 6.2 ) runs in the same way as the proof given in Theorem 10.
( 6 ) ( 1 ) . Consider a collection { E i } i = 1 n of S S I - T -relaxed indistinguishability fuzzy relations that separate points on a non-empty set X.
In the same manner as in the proof of Theorem 10, we can prove that H transforms n-dimensional triangular triplets in i = 1 n [ 0 , f T i ( 0 ) ] into a one-dimensional triangular triplet in [ 0 , f T ( 0 ) ] implies that F ( E 1 , , E n ) satisfies that
T ( F ( E 1 , , E n ) ( u , v ) , F ( E 1 , , E n ) ( v , w ) ) F ( E 1 , , E n ) ( u , w )
for all u , v , w { x , y , z } and for each x , y , z X .
It is obvious that F ( E 1 , , E n ) ( x , y ) = F ( E 1 , , E n ) ( y , x ) for all x , y X .
Now let x , y X . Set
a = ( f T 1 ( E 1 ( x , y ) ) , , f T n ( E n ( x , y ) ) ) , b = ( f T 1 ( E 1 ( x , x ) ) , , f T n ( E n ( x , x ) ) )
and c = ( f T 1 ( E 1 ( y , y ) ) , , f T n E ( n ( y , y ) ) ) . Clearly, a , b , c i = 1 n [ 0 , f T i ( 0 ) ] . We can assume that E i ( x , y ) [ 0 , 1 [ for all i = 1 , , n because otherwise we have that x = y , and there is nothing to prove. Notice that b i a i and c i b i for all i = 1 , , n . Suppose that
F ( E 1 , , E n ) ( x , y ) = F ( E 1 , , E n ) ( x , x ) = F ( E 1 , , E n ) ( y , y ) .
Then H ( a ) = f T F ( E 1 , , E n ) ( x , y ) = f T F ( E 1 , , E n ) ( x , x ) = H ( b ) and H ( a ) = f T F ( E 1 , , E n ) ( y , y ) = H ( c ) . Whence we deduce that there exist i { 1 , , n } such that a i = b i = c i . The injectivity of f T gives that E i ( x , y ) = E i ( x , x ) = E i ( y , y ) and, thus, that x = y .
Finally, we show that F ( E 1 , , E n ) ( x , y ) F ( E 1 , , E n ) ( x , x ) for all x , y X . Indeed, we can assume that, for each i { 1 , , n } , either E i ( x , y ) < E i ( x , x ) or E i ( x , y ) < E i ( y , y ) . Otherwise, x = y , and hence, the preceding inequality is held trivially. Then we have that, for each i { 1 , , n } , either a i > b i or a i > c i . So H ( a ) H ( b ) and H ( a ) H ( c ) . Hence
f T F ( E 1 , , E n ) ( x , y ) f T F ( E 1 , , E n ) ( x , x )
and
f T F ( E 1 , , E n ) ( x , y ) f T F ( E 1 , , E n ) ( y , y ) .
Since f T is a strictly decreasing function, we find that F ( E 1 , , E n ) ( x , y ) F ( E 1 , , E n ) ( x , x ) and F ( E 1 , , E n ) ( x , y ) F ( E 1 , , E n ) ( y , y ) . □
In the particular case in which all t-norms are strict continuous Archimedean t-norms, we obtain from Theorem 13 the result below.
Corollary 6.
Let n N , let T = { T i } i = 1 n be a collection of continuous Archimedean t-norms, and let { f T i } i = 1 n be a collection of additive generators of T . If T is a continuous Archimedean t-norm and F : [ 0 , 1 ] n [ 0 , 1 ] is a function, then the following assertions are equivalent:
(1) 
F aggregates S S I - T -relaxed indistinguishability fuzzy relations that separate points into an S S I -T-relaxed indistinguishability fuzzy relation that separates points.
(2) 
F satisfies the following conditions:
(2.1) 
If a , b , c [ 0 , 1 ] n such that a i b i and a i c i for all i = 1 , , n and a i [ 0 , 1 ] for all i = 1 , , n and F ( a ) = F ( b ) = F ( c ) , then there exists i { 1 , , n } such that a i = b i = c i . Moreover, if for each i { 1 , , n } , either a i < b i or a i < c i , then F ( a ) F ( b ) and F ( a ) F ( c ) .
(2.2) 
If a , b , c [ 0 , 1 ] n such that ( a , b , c ) is an n-dimensional T -triangular triplet, then ( F ( a ) , F ( b ) , F ( c ) ) is a one-dimensional T-triangular triplet.
(3) 
The function G : [ 0 , + ] n [ 0 , + ] , where G = f T F ( f T 1 1 × × f T n 1 ) , satisfies the following assertions:
(3.1) 
Let a , b , c [ 0 , + ] n such that a i c i and b i c i for all i = 1 , , n with a i ] 0 , + ] for all i = 1 , , n . If G ( a ) = G ( b ) = G ( c ) , then there exists i { 1 , , n } such that a i = b i = c i . Moreover, if for each i { 1 , , n } , either a i > b i or a i > c i , then G ( a ) G ( b ) and G ( a ) G ( c ) .
(3.2) 
G transforms n-dimensional triangular triplets in [ 0 , + ] n into a one-dimensional triangular triplet in [ 0 , + ] .
(4) 
The function G : [ 0 , + ] n [ 0 , + ] aggregates every collection { d i } i = 1 n of S S D -relaxed metrics into an S S D -relaxed metric, where G = f T F ( f T 1 1 × × f T n 1 ) .

4. Conclusions

In [36], characterizations of those functions that aggregate a collection of T -relaxed indistinguishability fuzzy relations were given in terms of triangular triplets in the spirit of Theorem 2. In this paper, we have complemented the aforementioned work. In particular, we have shown that there is an equivalence between those functions that aggregate T -relaxed indistinguishability fuzzy relations and those functions aggregating relaxed pseudo-metrics. The aforesaid equivalence has also been expressed in terms of triangular triplets. An interesting consequence derived from the obtained equivalence is that the functions under consideration are in correspondence with those that are subaddtive. Moreover, the distinguished class of S S I - T -relaxed indistinguishability fuzzy relations has been also studied. We have proved that functions merging this special type of relaxed indistinguishability fuzzy relations can be expressed through functions aggregating S S D -relaxed pseudo-metrics. It must be stressed that a notable difference between the class of functions that are able to aggregate a collection of relaxed indistinguishability fuzzy relations (relaxed pseudo-metrics) and S S I -relaxed indistinguishability fuzzy relations ( S S D -relaxed pseudo-metric) has been shown. Concretely, in this case, the appropriate class of functions are those that satisfy monotony and subadditivity. The separating points case has also been approached, and characterizations of the class of functions merging T -relaxed indistinguishability fuzzy relations that separate points are obtained in terms of T -triangular triplets. It must be pointed out that the aggregation of this type of relaxed indistinguishability fuzzy relations was not explored in [36]. Outstanding differences between those functions aggregating T -relaxed indistinguishability fuzzy relations and those that aggregate their counterpart separating points are shown. Illustrative examples of those functions able to aggregate any type of relaxed indistinguishability fuzzy relations will be given as future work in order to complement their description provided by the characterizations exposed in the present paper.
Although the exposed theory is presented for functions that aggregate a collection of T -relaxed indistinguishability fuzzy relations into a T-relaxed indistinguishability fuzzy relation, where T is continuous Archimedean t-norm, surprising results were discovered in [36] [Theorem 40] when the t-norm T is considered as the minimum t-norm T M , and in addition, relationships between functions aggregating T -relaxed indistinguishability fuzzy relations into a T M i n -relaxed indistinguishability fuzzy and those that aggregate S S I - T -relaxed indistinguishability fuzzy relations were obtained. As a future work, it seems interesting to explore new equivalences of the aforementioned functions in terms of functions that aggregate any kind of generalized metrics.
Observe that associativity does not seem to play any relevant role when relaxed T -relaxed indistinguishability fuzzy relations are generated and aggregated. In the literature, several works are devoted to exploring methodologies that generate, through generalized additive generators, new conjunctors which are not t-norms because they are not associative (see, for instance, [52,53]). The description of those functions that aggregate fuzzy relations induced via generalized additive generators and the study of the existing relationship with those functions that aggregate some type of associated generalized metric are natural research lines that could be addressed in the near future.

Author Contributions

All authors contribute equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Proyecto PGC2018-095709-B-C21 financiado por MCIN/AEI/ 10.13039/501100011033 y FEDER “Una manera de hacer Europa” and from project BUGWRIGHT2. This last project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreements No. 871260. This publication reflects only the authors views and the European Union is not liable for any use that may be made of the information contained therein.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

References

  1. Trillas, E. Assaig sobre les relacions d’indistingibilitat. In Proceedings of the Primer Congrés Català de Lògica Matemàtica, Barcelona, Spain, 30–31 June 1982; pp. 51–59. [Google Scholar]
  2. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer: Dordrecht, The Netherlands, 2000. [Google Scholar]
  3. Recasens, J. Indistinguishability Operators: Modelling Fuzzy Equalities and Fuzzy Equivalence Relations; Springer: Berlin/Heidelberg, Germany, 2010. [Google Scholar]
  4. Bejines, C.; Chasco, M.J.; Elorza, J.; Recasens, J. Preserving fuzzy subgroups and indistinguishability operators. Fuzzy Sets Syst. 2019, 373, 164–179. [Google Scholar] [CrossRef]
  5. Bejines, C.; Ardanza, S.; Chasco, M.J.; Elorza, J. Aggregation of indistinguishability operators. Fuzzy Sets Syst. 2021; in press. [Google Scholar]
  6. Boixader, D.; Recasens, J. On the relationship between fuzzy subgroups and indistinguishability operators. Fuzzy Sets Syst. 2019, 373, 149–163. [Google Scholar] [CrossRef]
  7. Calvo, T.; Fuster-Parra, P. Aggregation of partial T -indistinguishability operators and partial pseudo-metrics. Fuzzy Sets Syst. 2019, 403, 119–138. [Google Scholar] [CrossRef]
  8. Calvo, T.; Recasens, J. On the representation of local indistinguishability operators. Fuzzy Sets Syst. 2021, 410, 90–108. [Google Scholar] [CrossRef]
  9. De Baets, B.; Mesiar, R. Pseudo-metrics and T-equivalences. Fuzzy Math. 1997, 5, 471–481. [Google Scholar]
  10. De Baets, B.; Mesiar, R. Metrics and T-equalities. J. Math. Anal. Appl. 1997, 267, 531–547. [Google Scholar] [CrossRef]
  11. Drewniak, J.; Dudziak, U. Aggregation preserving classes of fuzzy relations. Kybernetika 2005, 41, 265–284. [Google Scholar]
  12. Drewniak, J.; Dudziak, U. Preservation of properties of fuzzy relations during aggregation processes. Kybernetika 2007, 43, 115–132. [Google Scholar]
  13. Drewniak, J.; Dudziak, U. Aggregation in classes of fuzzy relations. Stud. Math. 2006, 5, 33–43. [Google Scholar]
  14. Dudziak, U. Preservation of t-norm and t-conorm based properties of fuzzy relations during aggregation process. In Proceedings of the 8th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT 2013), Milano, Italy, 11–13 September 2013; pp. 376–383. [Google Scholar]
  15. Jacas, J.; Recasens, J. Aggregation of T-Transitive Relations. Int. J. Intell. Syst. 2003, 18, 1193–1214. [Google Scholar] [CrossRef]
  16. Höhle, U. Fuzzy equalities and indistinguishability. In Proceedings of the EUFIT’93, Eurogress Aachen, Germany, 7–10 September 1993; Volume 1, pp. 358–363. [Google Scholar]
  17. Höhle, U. Many valued equalities and their representation. In Logical, Algebraic, Analytic and Probabilistic Aspects of Triangular Norms; Klement, E.P., Mesiar, R., Eds.; Elsevier: Amsterdam, The Netherlands, 2005; pp. 301–320. [Google Scholar]
  18. de Mántaras, R.L.; Valverde, L. New results in fuzzy clustering based on the concept of indistinguishability relation. IEEE Trans. Pattern Anal. Mach. Intell. 1988, 10, 754–757. [Google Scholar] [CrossRef]
  19. Mayor, G.; Recasens, J. Preserving T-transitivity. In Artificial Intelligence Research and Development; Nebot, À., Binefa, X., López de Mántaras, R., Eds.; IOS Press: Amsterdam, The Netherlands, 2016; Volume 288, pp. 79–87. [Google Scholar]
  20. Ovchinnikov, S. Representation of transitive fuzzy relations. In Aspects of Vagueness; Skala, H.J., Termini, S., Trillas, E., Eds.; Springer: Dordrecht, The Netherlands, 1984; pp. 105–118. [Google Scholar]
  21. Recasens, J. On the Relationship between Positive Definite Matrices and t-norms. Fuzzy Sets Syst. 2021; in press. [Google Scholar]
  22. Miñana, J.-J.; Valero, O. On indistinguishability operators, fuzzy metrics and modular metrics. Axioms 2017, 6, 34. [Google Scholar] [CrossRef]
  23. Pedraza, T.; Rodríguez-López, J.; Valero, O. Aggregation of fuzzy quasi-metrics. Inform. Sci. 2021, 581, 361–389. [Google Scholar] [CrossRef]
  24. Saminger, S.; Mesiar, R.; Bodenhofer, U. Domination of aggregation operators and preservation of transitivity. Int. J. Uncertain. Fuzziness 2002, 10, 11–35. [Google Scholar] [CrossRef] [Green Version]
  25. Valverde, L. On the structure of F-indistinguishability operators. Fuzzy Set. Syst. 1985, 17, 313–328. [Google Scholar] [CrossRef]
  26. Deza, M.M.; Deza, E. Encyclopedia of Distances; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
  27. Pradera, A.; Trillas, E.; Castiñeira, E. On the aggregation of some classes of fuzzy relations. In Technologies for Constructing Intelligent Systems; Bouchon-Meunier, B., Gutierrez, J., Magdalena, L., Yager, R., Eds.; Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2002; Volume 90, pp. 125–147. [Google Scholar]
  28. Pradera, A.; Trillas, E.; Castiñeira, E. On distances aggregation. In Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems International Conference, Madrid, Spain, 3–7 July 2000; Lesot, M.-J., Vieira, S., Reformat, M.Z., Carvalho, J.P., Wilbik, A., Bouchon-Meunier, B., Yager, R.R., Eds.; Volume II, pp. 693–700. [Google Scholar]
  29. Copson, E.T. Metric Spaces; Cambridge University Press: Cambridge, UK, 1968. [Google Scholar]
  30. Beliakov, G.; Bustince, H.; Calvo, T. A Practical Guide to Averaging Functions, Studies in Fuzziness and Soft Computing; Springer: Berlin/Heidelberg, Germany, 2016. [Google Scholar]
  31. Doboš, J. Metric Preserving Functions; Štroffek: Košice, Slovakia, 1998. [Google Scholar]
  32. Grabisch, M.; Marichal, J.-L.; Mesiar, R.; Pap, E. Aggregation Functions; Cambridge University Press: Cambridge, UK, 2009. [Google Scholar]
  33. Fodor, J.; Roubens, M. Fuzzy Preference Modelling and Multicriteria Decision Support; Kluwer: Dordrecht, The Netherlands, 1994. [Google Scholar]
  34. Borsik, J.; Doboš, J. On a product of metric spaces. Math. Slovaca 1981, 31, 193–205. [Google Scholar]
  35. Pradera, A.; Trillas, E. A note on pseudo-metrics aggregation. Int. J. Gen. Syst. 2002, 31, 41–51. [Google Scholar]
  36. Calvo Sánchez, T.; Fuster-Parra, P.; Valero, O. The aggregation of transitive fuzzy relations revisited. Fuzzy Sets Syst. 2020; in press. [Google Scholar]
  37. González-Hedström, J.-D.-D.; Miñana, J.-J.; Valero, O. Aggregation of indistinguishability fuzzy relations revisited. Mathematics 2021, 9, 1441. [Google Scholar] [CrossRef]
  38. Hitzler, P.; Seda, A.K. Mathematical Aspects of Logic Programming Semantics; CRC Press: Boca Raton, FL, USA, 2011. [Google Scholar]
  39. Matthews, S.G. Metric Domains for Completeness. Ph.D. Thesis, University of Warwick, Coventry, UK, 1986. [Google Scholar]
  40. Hitzler, P.; Seda, A.K. Generalized distance functions in the theory of computation. Comput. J. 2010, 53, 443–464. [Google Scholar]
  41. Matthews, S.G. Notes on Separability in Metric Sets; Department of Computer Science Research Report CS-RR-160; The University of Warwick: Coventry, UK, 1990. [Google Scholar]
  42. Bukatin, M.; Kopperman, R.; Matthews, S.G. Some corollaries of the correspondence between partial metric and multivalued equalities. Fuzzy Set. Syst. 2014, 256, 57–72. [Google Scholar] [CrossRef]
  43. Fuster-Parra, P.; Martín, J.; Miñana, J.-J.; Valero, O. A study on the relationship between relaxed metrics and indistinguishability operators. Soft Comput. 2019, 23, 6785–6795. [Google Scholar] [CrossRef]
  44. Heckmann, R. Approximation of metric spaces by partial metric spaces. Appl. Categor. Struct. 1999, 7, 71–83. [Google Scholar] [CrossRef]
  45. Romaguera, S.; Valero, O. Complete partial metric spaces have partially metrizable computational models. Int. J. Comput. Math. 2012, 89, 284–290. [Google Scholar] [CrossRef]
  46. Shahza, N.; Valero, O. On 0-complete partial metric spaces and quantitative fixed point techniques in Denotational Semantics. Abstr. Appl. Anal. 2013, 2013, 11. [Google Scholar]
  47. Alghamdi, M.A.; Shahzad, N.; Valero, O. Fixed point theorems in generalized metric spaces with applications to Computer Science. Fixed Point Theory Appl. 2013, 2013, 118. [Google Scholar] [CrossRef]
  48. Romaguera, S.; Valero, O. A quantitative computational model for complete partial metric spaces via formal balls. Math. Struct. Comput. Sci. 2009, 19, 541–563. [Google Scholar] [CrossRef]
  49. Matthews, S.G. Partial metric topology. Ann. N. Y. Acad. Sci. 1994, 728, 183–197. [Google Scholar] [CrossRef]
  50. Demirci, M. The order-theoretic duality and relations between partial metrics and local equalities. Fuzzy Set. Syst. 2011, 192, 45–57. [Google Scholar] [CrossRef]
  51. Montes, S.; Montes, I.; Iglesias, T. Fuzzy relations: Past, present and future. In Handbook of Computational Intelligence; Kacprzyk, J., Pedrycz, W., Eds.; Springer: Dordrecht, The Netherlands, 2015; pp. 171–181. [Google Scholar]
  52. Mesiar, R. Generated conjunctions and related operators in MV-logic as a basis of AI applications. In Proceedings of the 13th European Conference on Artificial Intelligence (ECAI 98), Brighton, UK, 23–28 August 1998; pp. 1–5. [Google Scholar]
  53. Viceník, P. A note on generators of t-norms. Busefal 1998, 75, 33–38. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

González-Hedström, J.-D.-D.; Miñana, J.-J.; Valero, O. Relaxed Indistinguishability Relations and Relaxed Metrics: The Aggregation Problem. Axioms 2022, 11, 431. https://doi.org/10.3390/axioms11090431

AMA Style

González-Hedström J-D-D, Miñana J-J, Valero O. Relaxed Indistinguishability Relations and Relaxed Metrics: The Aggregation Problem. Axioms. 2022; 11(9):431. https://doi.org/10.3390/axioms11090431

Chicago/Turabian Style

González-Hedström, Juan-De-Dios, Juan-José Miñana, and Oscar Valero. 2022. "Relaxed Indistinguishability Relations and Relaxed Metrics: The Aggregation Problem" Axioms 11, no. 9: 431. https://doi.org/10.3390/axioms11090431

APA Style

González-Hedström, J. -D. -D., Miñana, J. -J., & Valero, O. (2022). Relaxed Indistinguishability Relations and Relaxed Metrics: The Aggregation Problem. Axioms, 11(9), 431. https://doi.org/10.3390/axioms11090431

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