T -Equivalences: The Metric Behavior Revisited

: Since the notion of T -equivalence, where T is a t-norm, was introduced as a fuzzy generalization of the notion of crisp equivalence relation, many researchers have worked in the study of the metric behavior of such fuzzy relations. Concretely, a few techniques to induce metrics from T -equivalences, and vice versa, have been developed. In several ﬁelds of computer science and artiﬁcial intelligence, a generalization of pseudo-metric, known as partial pseudo-metrics, have shown to be useful. Recently, Bukatin, Kopperman and Matthews have stated that the notion of partial pseudo-metric and a type of generalized T -equivalence are linked. Inspired by the preceding fact, in this paper, we state a concrete relationship between partial pseudo-metrics and the aforesaid generalized T -equivalences. Speciﬁcally, a method for constructing partial pseudo-metrics from the new type of T -equivalences and, reciprocally, for constructing the generalized T -equivalences from partial pseudo-metrics are provided. However, important differences between the new approach and the classical one are established. Special interest is paid to the case in which the minimum, drastic, and Łukasiewicz t-norms are under consideration.


Introduction
The notion of T-equivalence (or T-indistinguishability operator), where T is a t-norm, was introduced in fuzzy logic by Trillas with the aim of giving the minimal number of properties that a fuzzy relation should satisfy in order to be considered as a graded equivalence relation (for a detailed discussion of the topic, we refer the reader to [1,2]).
From now on, we make the assumption that the reader is familiar with the theory of triangular norms. One of the best bibliographical references on this topic is [3].
Following [1], a T-equivalence E is said to be a T-equality when, for all x, y ∈ X, the following condition is fulfilled: The notion of metric can be retrieved from the notion of pseudo-metric. Indeed, a metric d on X is a pseudo-metric which fulfills the next stronger version of axiom (d1) for all x, y ∈ X: (d1') d(x, y) = 0 ⇔ x = y.
Notice that actually the preceding introduced notions can take the value ∞ and, thus, they match up with extended (pseudo-)metrics and extended (pseudo-)ultrametric in the sense of [12].
In the aforementioned references, the following concrete correspondences between pseudo-metrics and T-equivalences were explored and stated.
In order to introduce the first type of aforesaid relationship, let us consider a t-norm T that admits an additive generator f T , a T-equivalence E on a nonempty set X and a function d E, f T : X × X → [0, ∞] defined by d E, f T (x, y) = f T (E(x, y)) for all x, y ∈ X. Then, it seems natural to wonder whether the function d E, f T is always a pseudo-metric. An affirmative answer to the posed question was provided by the next result and, thus, a technique for constructing pseudo-metrics from T-equivalences was developed (see, for instance, [4,5]). Theorem 1. Let X be a nonempty set whose cardinality is greater than 2. Let T and T * be two t-norms such that T * admits an additive generator f T * . Then, the next conditions are equivalent: 1. T * is weaker than T (i.e., T * (x, y) ≤ T(x, y) for all x, y ∈ X), 2. The function d E, f T * : X × X → [0, ∞] is a pseudo-metric on X for any T-equivalence E on X.
3. The function d E, f T * : X × X → [0, ∞] is a metric on X for any T-equality E on X.
Observe that in the statement of the preceding result the cardinality of the set X has been assumed to be greater than 2. This is due to the fact that the function d E, f is always a pseudo-metric (metric) on X for every function f : for all x, y ∈ X. Consequently, d E, f T * is always a pseudo-metric on X for every t-norm T * and any additive generator of T * whenever the cardinality of X is lower than 3. Clearly, in order to show the equivalence between 2 and 3, it is not necessary to assume such a constraint about the cardinality.
Since every t-norm T is weaker than T Min , the next surprising result which was deduced from Theorem 1 and can be found, for instance, in [4]. Corollary 1. Let X be a nonempty set and let E be a T Min -equivalence (T Min -equality) on X. If f T is an additive generator of a t-norm T, then the function d E, f T is a pseudo-metric (metric) on X.
The drastic t-norm T D is the weakest t-norm the following result, which can be found in [4], can also be deduced from Theorem 1.

Corollary 2.
Let X be a nonempty set and let E be a T-equivalence (T-equality) on X. If f T D is an additive generator of the drastic t-norm T D , then the function d E, f T D is a pseudo-metric (metric) on X.
With the aim of introducing the second type of relationship between pseudo-metrics and T-equivalences that have been explored in the literature, let us now consider a pseudo-metric d on a nonempty set X and a t-norm T that admits an additive generator f T . Then, one can wonder naturally if the fuzzy binary relation E d, f for all x, y ∈ X. The next result answered affirmatively the question raised when the T-norm is, in addition, continuous and, hence, it gave the following technique to generate T-equivalences from pseudo-metrics (see, for instance, [4,10]).

Theorem 2.
Let T be a t-norm which admits an additive generator f T . If T is continuous, then the following assertions hold: 1. If d is a pseudo-metric on X, then the fuzzy relation E d, f 2. If d is a metric on X, then the fuzzy relation E d, f Notice that the converse of the assertions in the statement of the preceding result are not true in general. As an illustrative example, take the function d : In view of Theorem 2, the question naturally arises about the necessity of the t-norm continuity. However, it was proved that such an assumption cannot be taken out in Example 3 of [4].
Notice that the Łukasiewicz t-norm T L admits the function f T L : [0, 1] → [0, ∞], given by f T L (x) = 1 − x, as additive generator. Then, in the particular case in which the t-norms T and T * are taken as T = T * = T L , Theorems 1 and 2 give the next celebrated result which can be found in [6]. Observe that in this case the constraint about the cardinality is not necessary. Corollary 3. Let X be a nonempty set and let E be a fuzzy relation on X. Then, the next conditions are equivalent: 1. E is a T L -equivalence (T L -equality) on X. 2. The function 1 − E (i.e., d E, f T L ) is a pseudo-metric (metric) on X.
It must be stressed that the minimum t-norm T Min does not admit an additive generator. However, a more explicit, than the given by Corollary 1, and a well-known relationship between T Min -equivalences and pseudo-metrics can directly be stated. Such a relationship was given in [11] (see, also, [1]).

Corollary 4.
Let X be a nonempty set and let E be a fuzzy relation on X. Then, the next conditions are equivalent: 1. E is a T Min -equivalence (T Min -equality). 2. The function 1 − E is a pseudo-ultrametric (ultrametric) on X.
In 1994, Matthews introduced a generalization of the metric notion which have shown to be a useful tool for developing quantitative models in computer science [13][14][15][16][17][18][19][20][21]. Concretely, such a notion is nowadays known as partial pseudo-metric. Let us recall, according to [12,15], that, given a non-empty set X, a partial pseudo-metric on X is a function p : X × X → [0, ∞] that fulfills for all x, y, z the axioms below: Similar to the metric case, the partial pseudo-metrics can take the value ∞. Thus, such a notion actually coincides with the counterpart to an extended pseudo-metric.
Note that a partial pseudo-metric satisfies all axioms of pseudo-metrics with exception of (d1). Indeed, given x ∈ X, a partial pseudo-metric p on X does not satisfy in general that p(x, x) = 0 such as the next example shows. Example 1. Consider the function p max : [0, ∞] × [0, ∞] → [0, ∞] defined by p max (x, y) = max{x, y} for all x, y ∈ [0, ∞]. It is not hard to verify that p max is a partial pseudo-metric. In addition, p max (x, x) = x = 0 for all x ∈]0, ∞].
According to [12,15], a partial metric on a nonempty set X is a partial pseudo-metric p that satisfies for all x, y ∈ X the axioms below: Clearly, the partial pseudo-metric p max is exactly a partial metric on [0, ∞]. It is obvious that a (pseudo-)metric on a nonempty set X is a partial (pseudo-)metric p such that p(x, x) = 0 for all x ∈ X.
Following [22], a partial pseudo-ultrametric on a nonempty set X is a partial pseudo-metric p on X which satisfies for all x, y, z the following: (p3') p(x, y) ≤ max{p(x, z), p(z, y)}.
When a partial pseudo-ultrametric p on a nonempty set X satisfies, in addition, the axiom (p0) then it is called partial ultrametric.
An instance of partial ultrametric is provided by the next example.

Example 2.
Consider the set of all finite and infinite sequences Σ ∞ over a nonempty alphabet Σ. Given v ∈ Σ ∞ , denote by l(v) the length of v. Thus, for all v, w ∈ Σ ∞ , where l(x, y) denotes the longest common prefix of x and y (of course, if x and y have not a common prefix, then l(x, y) = 0). We have adopted the convention that 2 −∞ = 0. It is not hard to check that p Σ is a partial (pseudo-)ultrametric on Σ ∞ .
Recently, it has been showed that the notions of T-equivalence and partial pseudo-metric are very closely linked. In particular, on the one hand, Demirci ([23]) and, on the other hand, Bukatin, Kopperman, and Matthews ( [22]) have elucidated that the logical counterpart for partial pseudo-metrics is, in some sense, a generalized T-equivalence that we have called partial T-equivalence.
Let us recall that, according to [24] (see also [22,25]), a partial T-equivalence E on a (nonempty) set X is a fuzzy relation E : X × X → [0, 1] satisfying for all x, y, z ∈ X the following axioms: where → T denotes the residual implication generated from the t-norm T. Observe that, in general, the t-norm is assumed to be left-continuous in order to guarantee that the residuation property is fulfilled (see [3] and Proposition 2.5.2 of [26]).
Moreover, a partial T-equivalence E will be called a partial T-equality provided that Notice that the notion of partial T-equivalence retrieves as a particular case the classical notion of T-equivalence whenever the partial T-equivalence E on X satisfies, in addition that E(x, x) = 1 for all x ∈ X. Indeed, the axiom (PE3) is transformed into the axiom (E3) because T(E(x, y), E(y, z)) = T(E(x, y), 1 → T E(y, z)) = T(E(x, y), E(y, y) → T E(y, z)) ≤ E(x, z). However, there are partial T-equivalences that are not T-equivalences like the next example proves.

Example 3.
Consider the set of all finite and infinite sequences Σ ∞ over a nonempty alphabet Σ. Denote by l(v) the length of v ∈ Σ ∞ as in Example 2. Define the fuzzy binary relation E Σ on Σ ∞ , where Taking into account the exposed relationship between, on the one hand, T-equivalences and partial T-equivalences and, on the other hand, between pseudo-metrics and T-equivalences, the purpose of the present work is to explore more in depth the duality correspondence between partial pseudo-metrics and partial T-equivalences. With this aim, we state a method for constructing partial pseudo-metrics from partial T-equivalences in the spirit of Theorem 1. Reciprocally, a method for constructing partial T-equivalences from partial pseudo-metrics is provided extending to the new context the technique given by Theorem 2. However, important differences between the new framework and the classical one are also established. Special interest is paid to the case in which the minimum, drastic, and Łukasiewicz t-norms are under consideration. Hence, counterparts to Corollaries 1, 3, and 4 are obtained in this new approach. Nevertheless, we show that Corollary 2 cannot be extended to the new framework. Finally, conclusions and future work are exposed.

Generating Partial Pseudo-Metrics from Partial T-Equivalences
In this section, we provide a method for constructing partial pseudo-metrics from partial T-equivalences. Such a method is studied in the case in which the triangular norm is continuous, since the t-norm under consideration in the notion of partial T-equivalence is left-continuous and we are interested, motivated by Theorem 1, in those t-norms that admits an additive generator. Let us recall that, when a triangular norm T admits an additive generator, the left-continuity of T is equivalent to its continuity (see Proposition 3.26 of [3]) and thus the t-norm T is Archimedean and continuous, i.e., T admits the following representation: for all x, y ∈ [0, 1]. Note that for continuous and Arquimedean t-norms f In this particular case, the residual implication → T is given as follows: The next result gives the aforesaid method in order to induce a partial pseudo-metric from a partial T-equivalence. Let us stress that, if the set X in which the partial T-equivalences are defined has cardinality lower than 3, then the function p E, f is always a partial pseudo-metric (partial metric) on X for every monotone (strictly monotone) function f : for all x, y ∈ X. Proposition 1. Let X be a nonempty set and let T be a continuous t-norm which admits an additive generator f T . If E is a partial T-equivalence on X, then the function p E, f T : for all x, y ∈ X.
Proof. Let us see that p E, f T verifies the axioms of a partial pseudo-metric. First, we show that p E, f T satisfies (p1). Since f T is strictly decreasing and E(x, y) ≤ E(x, x) for all x, y ∈ X, we have that Next, we show that p E, f T satisfies (p2). However, this is straightforward because of the symmetry of E. Indeed, for all x, y, z ∈ X. Moreover, the fact that f T is an additive generator of T gives that Hence, we obtain that y))}) . Next, we distinguish two possible cases: It follows that The fact that E is a partial T-equivalence on X gives, in addition, that T(E(x, y), E(y, y) → T E(y, z)) ≤ E(x, z). Thus, Since f T is strictly decreasing, we deduce that .
for all x, y ∈ [0, 1], f T is strictly decreasing, and E(y, z) ≤ E(y, y), we deduce that whence we obtain that Case 2. f T (E(x, y)) + f T (E(y, z)) − f T (E(y, y)) / ∈ Range( f T ). Then, the fact that f is an additive generator of T gives that Therefore, p E, f T satisfies (p3) as claimed.
An example of partial pseudo-metric constructed by means of the technique given by Proposition 1 is the following one (see also Example 6).

Example 4.
Consider again the set of all finite and infinite sequences Σ ∞ over a nonempty alphabet Σ and fuzzy binary relation E Σ on Σ ∞ introduced in Example 3. It is clear that E Σ is a partial T L -equivalence on Σ ∞ . Proposition 1 guarantees that the function p E, f T is a partial pseudo-metric on Σ ∞ with p E, f T (x, y) = 1 − E Σ (u, v) for all u, v ∈ Σ ∞ . Observe that the partial pseudo-metric p E, f T coincides with the partial pseudo-metric p Σ introduced in Example 2.
When the partial T-equivalence is exactly a T-equivalence, we obtain the next result from Proposition 1.

Corollary 5.
Let X be a nonempty set and let T be a continuous t-norm which admits an additive generator f T . If E is a T-equivalence on X, then the function p E, f T : for all x, y ∈ X.
Proof. Proposition 1 gives that the function p E, f T is a partial pseudo-metric on X. Moreover, In the light of the preceding result and taking into account that, in the statement of Theorem 1, the continuity of the t-norm is not required, it seems natural to ask if actually one can remove the continuity from the statement of Proposition 1. The next example gives a negative answer to the posed question and, thus, shows a difference between the new approach and the classical one. It is not hard to check that E is a T D -equivalence and, hence, a partial T D -equivalence, where T D is the drastic t-norm. Nevertheless, the function p E, f T D is not a partial pseudo-metric on [0, 1] because it does not satisfy the axiom (p3). Indeed, When the partial T-equivalence is exactly a partial T-equality, we obtain the following refined version of the technique given by Proposition 1.

Proposition 2.
Let X be a nonempty set and let T be a continuous t-norm which admits an additive generator f T . If E is a partial T-equality on X, then the function p E, f T : X × X → [0, ∞] is a partial metric, where p E, f T (x, y) = f T (E(x, y)), for all x, y ∈ X.
Proof. It is only necessary to prove that the function p E, f T fulfills the axiom (p0). Since f T is strictly decreasing, we deduce that E(x, x) = E(y, y) = E(x, y) ⇔ p E, f T (x, x) = p E, f T (y, y) = p E, f T (x, y). Thus, we obtain, from the fact that E is a T-equality, that p E, f T (x, x) = p E, f T (y, y) = p E, f T (x, y) ⇔ x = y.
In the particular case in which the partial T-equality is exactly a T-equality, we obtain the next result from Proposition 2. Corollary 6. Let X be a nonempty set and let T be a continuous t-norm which admits an additive generator f T . If E is a T-equality on X, then the function p E, f T : for all x, y ∈ X.
Proof. Corollary 5 gives that the function p E, f T is a pseudo-metric on X. Moreover, taking into account that f T is strictly decreasing and that f T (1) = 0, we have that 0 The next example gives an instance of a partial metric generated by means of the methodology provided in Proposition 2, which is not a metric.

Example 6. Let E be the fuzzy relation on
for all x, y ∈ X. Consider the additive generator f T P of the product t-norm given by f T P (x) = − log(x) for all x ∈ [0, 1], where we assume that log(0) = ∞. Since E is a partial T P -equality, Proposition 2 yields that the function p E, f T P is a partial metric on [0, 1], where for all x, y ∈ [0, 1].
Next, we focus our effort on trying to obtain a version of Theorem 1 in our new framework. Recall that, if the set X in which the partial T-equivalences are defined has cardinality lower than 3, then the function p E, f T is always a partial pseudo-metric (partial metric) on X.
Theorem 3. Let X be a nonempty set. Assume that T and T * are two continuous t-norms and that T * admits an additive generator f T * . Then, the following assertions are equivalent: 1. The function p E, f T * : X × X → [0, ∞] is a partial pseudo-metric on X for the partial T-equivalence E on X. 2. The function p E, f T * : X × X → [0, ∞] is a partial metric on X for the partial T-equality E on X.
Proof. If the cardinality of the set X is lower than 3, then both assertions are equivalent. Assume that the cardinality of the set X is greater than 3. Next, we show the equivalence between both assertions.
1. ⇒ 2. Assume that E is a partial T-equality on X. Then, the function p E, f T * : X × X → [0, ∞] is a partial pseudo-metric on X. We only need to show that p E, f T * satisfies axiom (p0) when the partial T-equivalence E is a partial T-equality on X. Since f T * is strictly decreasing, we deduce that Thus, p E, f T * is a partial metric on X.
2. ⇒ 1. For the purpose of contradiction, we assume that there exists a t-norm T, a non-empty set X, and a partial T-equivalence E on X such that the function p E, f T * is not a partial pseudo-metric on X. It follows that p E, f T * does not satisfy either condition (p1) or condition (p3).
First, we suppose that (p1) is not fulfilled. Then, there exists x, y ∈ X such that p E, f T * (x, y) < p E, f T * (x, x), whence we obtain that f T * (E(x, y)) < f T * (E(x, x)). However, the fact that f T * is strictly decreasing provides that E(x, x) < E(x, y), which is a contradiction because E is a partial T-equivalence and, thus, E(x, y) ≤ E(x, x).
Next, we suppose that (p3) is not fulfilled. Then, there exists x, y, z ∈ X such that p E, f T * (x, y) > p E, f T * (x, z) + p E, f T * (z, y) − p E, f T * (z, z). Next, we show that max{E(x, y), E(x, z), E(y, z)} < 1. We differentiate the following three possible cases: Case 1. E(x, y) = 1. Then, we have that which is not possible. y). The fact that E is a partial T-equivalence yields that T(E(x, z), E(z, z) → T E(z, y)) ≤ E(x, y).
Since max{E(x, y), E(x, z), E(y, z)} < 1, we define a binary fuzzy relation E on Y = {x, y, z} as follows: for all w, v, u ∈ Y. Therefore, E is a partial T-equality on Y. By hypothesis, we have that p E , f T * is a partial metric on Y. Then, for all x, y, z ∈ Y. However, this contradicts the fact that The next result establishes what is the relationship between the t-norms T and T * when the function p E, f T * is a partial (pseudo-)metric on X for any partial T-equivalence (T-equality) E on X. Notice that, in this direction, an important difference appears with respect to what occurs in the classical case (see Theorem 1). Theorem 4. Let X be a nonempty set with cardinality greater than 2. Assume that T and T * are two continuous t-norms and that T * admits an additive generator f T * . If the function p E, f T * : X × X → [0, ∞] is a partial metric on X for the partial T-equality E on X, then T * is weaker than T.

Proof.
Suppose that E is a partial T-equality on X. Let a, b ∈ [0, 1]. Our aim is to show that T * (a, b) ≤ T(a, b). With this aim, consider three different elements x, y, z ∈ X and the fuzzy binary relation E on X given by: Notice that we can assume that a, b ∈ [0, 1[ because, if max{a, b} = 1, then we have immediately that T * (a, b) = T(a, b). A straightforward computation yields that E is partial T-equality on X.
By assumption, we have that p E, f T * is a partial metric on X. Thus, for all x, y, z ∈ X, whence we obtain that Contrary to the classical metric case, the converse of the preceding implication is not true in general such as the next example shows. According to [3,27], each t-norm T MT λ is continuous.
Next, consider the fuzzy binary relation E on a set X = {x, y, z} such that E(x, x) = E(y, y) = E(z, z) = 0.89, E(x, y) = E(y, x) = 0, and E(x, z) = E(z, x) = E(y, z) = E(z, y) = 0.45. It is not hard to check that E is a T MT 0.9 -equivalence. Clearly, T L is weaker than T MT 0.9 , i.e., T L (x, y) ≤ T MT 0.9 (x, y) for all x, y ∈ [0, 1]. Nevertheless, p E, f T L (x, y) = 1 − E(x, y) is not a partial pseudo-metric on X. In fact, Combining Theorems 1 and 4, the following result can be stated. Corollary 7. Let X be a nonempty set with cardinality greater than 2. Assume that T and T * are two continuous t-norms and that T * admits an additive generator f T * . Then, each of the following assertions implies its successor.
1. The function p E, f T * : X × X → [0, ∞] is a partial pseudo-metric on X for any partial T-equivalence E on X. 2. The function p E, f T * : X × X → [0, ∞] is a partial metric on X for any partial T-equality E on X. 3. T * is weaker than T. 4. The function p E, f T * : X × X → [0, ∞] is a pseudo-metric on X for any T-equivalence E on X. 5. The function p E, f T * : X × X → [0, ∞] is a metric on X for any T-equality E on X.
The fact that every t-norm T is weaker than T Min allows us to deduce, from Proposition 1, the next result which extends Corollary 1 to our context. Corollary 8. Let X be a nonempty set and let E be a partial T Min -equivalence (partial T Min -equality) on X. If f T is the additive generator of any continuous t-norm T, then the function p E, f T is a partial pseudo-metric (partial metric) on X.
Therefore, E is a partial T-equivalence. Thus, by Proposition 1, we have that p E, f T is a partial pseudo-metric on X. Similar arguments allow us to show that p E, f T is a partial metric on X whenever E is a T Min -equality on X but now applying Proposition 2.
We end this section pointing out another difference between the new approach and the classical one. Indeed, observe that Example 5 shows that a direct extension of Corollary 2 to our context fails to hold.

Generating Partial T-Equivalences from Partial Pseudo-Metrics
In the following, we show that the converse of Proposition 1 is fulfilled. Thus, we provide a method for constructing partial T-equivalences from partial pseudo-metrics. Moreover, we show that the classical method, given by Theorem 2, for generating T-equivalences from pseudo-metrics is retrieved as a particular case.
Theorem 5. Let X be a nonempty set and let T be a continuous t-norm which admits an additive generator f T . If p : X × X −→ [0, ∞] is a partial pseudo-metric, then the binary fuzzy relation E p, f T : X × X → [0, 1] given by , y)) for all x, y ∈ X is a partial T-equivalence on X.
Corollary 11. Let X be a nonempty set and let E be a fuzzy binary relation on X. Then, the following assertions are equivalent: 1. E is a partial T Min -equivalence (T Min -equality). 2. The function 1 − E is a partial pseudo-ultrametric (partial ultrametric) on X.
Proof. 1. ⇒ 2. Taking T = T L in Corollary 8, we deduce that 1 − E is a partial pseudo-metric on X. Next, we show that, in addition, 1 − E is a partial pseudo-ultrametric on X. Since E is a partial T Min -equivalence, we have for all x, y, z ∈ X that min{E(x, y), E(y, z)} = T Min (E(x, y), E(y, y) → T Min E(y, z)) ≤ E(x, z).
Moreover, it is clear that the following sequence of inequalities are equivalent for all x, y, z ∈ X: 2. ⇒ 1. The fact that 1 − E is a partial pseudo-ultrametric on X gives that it is a partial pseudo-metric on X. By Corollary 9, we deduce that E is a partial T L -equivalence on X. Thus, E satisfies axioms (PE1) and (PE2). It remains to prove that T Min (E(x, y), E(y, y) → T Min E(y, z)) ≤ E(x, z).
It must be stressed that Corollary 11 ensures that the partial T Min -equivalence introduced in Example 3 is the logic counterpart of the partial ultrametric p Σ introduced in Example 2 such as it was suggested in [22].
We get Theorem 2 from Theorem 5 when the partial pseudo-metric is a pseudo-metric.
Corollary 12. Let X be a nonempty set and let T be a continuous t-norm which admits an additive generator f T . Then, the following assertions hold: 1. If p : X × X −→ [0, ∞] is a pseudo-metric, then the binary fuzzy relation E p, f T : X × X → [0, 1], given by is a T-equivalence on X. 2. If p : X × X −→ [0, ∞] is a metric, then the binary fuzzy relation E p, f T : X × X → [0, 1], given by , y)) for all x, y ∈ X, is a T-equality on X.
Observe that, in assertion 2 in the statement of Corollary 12, we do not need to assume the condition "p(x, y) ≤ f T (0) for all x, y ∈ X" because we always have that From Proposition 3, we can derive the following result whose easy proof we omit. In order to state such a result, let us recall that, according to Proposition 3.29 and Corollary 3.30 of [3], a continuous t-norm which admits that an additive generator f T is strict provided that f T (0) = ∞. Corollary 13. Let X be a nonempty set and let T be a strict continuous t-norm which admits an additive generator f T . If p : X × X −→ [0, ∞] is a partial metric, then the binary fuzzy relation E p, f T : X × X → [0, 1] given by is a partial T-equality on X.
Inspired by the classical pseudo-metric case (see Section 1), we wonder if the continuity of the t-norm can be deleted in the statement of Theorem 5. We end the paper with an example which gives a negative response to such a question.

Example 9.
Let us consider the partial metric p + on [0, ∞[ defined by Then, p + ( 1 2 , 0) = 1 2 , p + (0, 1) = 1 and p + ( 1 2 , 1) = 3 2 . Consider, in addition, the drastic t-norm T D that is not continuous and admits an additive generator. It is clear that the fuzzy binary relation E p + , f T D on [0, ∞[ induced by the technique stated in Theorem 5 is given by However, it is clear that E p + , f T D is not a T D -equivalence on [0, ∞[, since

Conclusions
The notion of T-equivalence, where T is a t-norm, was introduced as a fuzzy generalization of the notion of crisp equivalence relation. Since then, many efforts have been devoted to the study of the metric behavior of such fuzzy relations. Concretely, a few techniques to induce metrics from T-equivalences, and, vice versa, have been deeply developed (see Theorems 1 and 2). Motivated by the fact that partial pseudo-metrics, a generalization of of pseudo-metrics that have been shown to be useful in computer science and artificial intelligence, have been suggested as the logical counterpart of T-equivalences, we have studied the duality correspondence between partial pseudo-metrics and partial T-equivalences. Concretely, a method for constructing partial pseudo-metrics from partial T-equivalences have been provided in the spirit of the classical case (see Propositions 1 and 2 and Theorem 3). However, in contrast to the aforementioned case, in the new approach, the continuity of the t-norm has been shown to be crucial. Moreover, a method for constructing partial T-equivalences from partial pseudo-metrics is also provided in such a way that the classical one is retrieved as a particular case (see Theorem 5 and Corollaries 9, 10 and 11). Important differences between the new framework and the classical one have been shown (see Theorem 4 and Proposition 3).
As future work, we consider the possibility of exploring those conditions that allow us to induce partial pseudo-metrics from partial T-equivalences according to the technique stated in Proposition 1 when the t-norms involved are not left-continuous. With this aim, we will try to take advantage of the method to generate implications with respect to non left-continuous t-norms given by Biba and Hliněná in [28].
Author Contributions: All authors contributed equally in the preparation, development and writing this article. All authors have read and agreed to the published version of the manuscript.