762
Views
1
CrossRef citations to date
0
Altmetric
Research Article

A Study of (T, N)– and (N, T, N)– Implications

ORCID Icon & ORCID Icon
Pages 277-295 | Received 23 Nov 2020, Accepted 05 Apr 2021, Published online: 19 Jun 2021

Abstract

In this paper, we revisit and study the basic properties of two families of fuzzy implications, the so-called (T,N) and (N,T,N) implications. More specific, we study when these fuzzy implications satisfy, or not, the neutrality property (NP), the exchange principle (EP), the identity principle (IP) and the ordering property (OP). Moreover, a study is presented for the law of importation (LI) with respect to a t- norm. Also, we study the relation of Φconjugation in (N,T,N) implications.

1. Introduction

The generalization of the notion of implication from classical to fuzzy logic is a known process with its difficulties [Citation1,Citation2]. In this paper, we will study the properties of such generalizations, the so-called (T,N) and (N,T,N) implications. These implications are the generalization of the following classical tautology (1) (pq)(pq)(1) Firstly, (T,N) implications mentioned by many authors, such as Dubois and Prade [Citation3] in 1984, Fodor [Citation4,Citation5] in 1991, Fodor and Roubens [Citation2] in 1994 and Klement et al. [Citation6] in 2000. These authors addressed their correlation with another family, the so called (S,N) implications, when we use a strong negation N. Bedregal [Citation7] in 2007 defined them for any t-norm and any fuzzy negation. Baczyński and Jayaram [Citation1] in 2008 related them with R-implications, when the t-norm T is left continuous and N is a strong negation. Pradera et al. [Citation8] in 2016 mentioned the formula of (T,N) implications, using aggregation functions in general. Despite these references, they remained anonymous and unstudied until 2017.

In 2017, Pinheiro et al. [Citation9] in their homonymous paper named them (T,N) implications. They studied them in 2017 [Citation9] and 2018 [Citation10] for strong and not, negations. Some more results on functional equations and (T,N) implications are presented by Pinheiro et al. in 2018 [Citation11]. In 2020 [Citation12], the intersection between (S,N) and (T,N) implications presented and moreover their close relation in a way that they simulate the same (or a similar) way of classical thinking. Additionally, since a fuzzy negation is not a uniquely determined function in 2018 Pinheiro at al. [Citation13] studied (N,T,N) implications, which are (T,N) implications generated from not necessary the same negation.

The aforementioned recent interest was the motivation of our study. In this paper, we revisit (T,N) and (N,T,N) implications and we study whether or not they satisfy basic properties of fuzzy implications and the law of importation with respect to a t-norm [Citation1].

2. Preliminaries

Definition 2.1

[Citation1,Citation2,Citation6,Citation14]

A decreasing function N:[0,1][0,1] is called fuzzy negation, if N(0)=1 and N(1)=0. Moreover, a fuzzy negation N is called

  1. strict, if it is continuous and strictly decreasing,

  2. strong, if it is an involution, i.e. N(N(x))=x,for all x[0,1],

  3. and non-filling, if N(x)=1x=0.

Remark 2.1

The so-called crisp fuzzy negations ([Citation15, Remark 2.1]) are (2) Nα(x)=0,if xα1,if x<α,where α(0,1]and(2) (3) Nα(x)=0,if x>α1,if xα, where  α[0,1).(3)

Lemma 2.1

[Citation1, Lemma 1.4.9].

If N, N are fuzzy negations such that NN=Id[0,1], then

(i)

N is a continuous fuzzy negation,

(ii)

N is a strictly decreasing fuzzy negation.

Definition 2.2

[Citation1,Citation6,Citation14]

A function T:[0,1]2[0,1] is called a triangular norm (shortly t-norm), if it satisfies, for all x,y,z[0,1], the following conditions (T1) T(x,y)=T(y,x),(T1) (T2) T(x,T(y,z))=T(T(x,y),z),(T2) (T3) if yz,then T(x,y)T(x,z), i.e., T(x,) is increasing,(T3) (T4) T(x,1)=x.(T4) Dually, a function S:[0,1]2[0,1] is called a triangular conorm (shortly t-conorm) if it satisfies, for all x,y,z[0,1], the above conditions (T1), (T2), (T3), which are denoted by (S1), (S2), (S3) and additionally (S4) S(x,0)=x.(S4)

Definition 2.3

[Citation1,Citation6]

A t-norm T is strictly monotone, if T(x,y)<T(x,z), whenever x>0 and y<z.

Definition 2.4

[Citation1,Citation6]

A t-norm T is called continuous if it is continuous in both the arguments.

Definition 2.5

[Citation1, Definition 2.3.14].

Let T be a t-norm and N be a fuzzy negation. We say that the pair (T,N) satisfies the law of contradiction if (LC) T(N(x),x)=0,x[0,1].(LC)

Definition 2.6

[Citation1,Citation16]

By Φ we denote the family of all increasing bijections from [0,1] to [0,1]. We say that functions f,g:[0,1]n[0,1] are Φ- conjugate, if there exists a ϕΦ such that g=fϕ, where fϕ(x1,x2,,xn)=ϕ1(f(ϕ(x1),ϕ(x2),,ϕ(xn))),x1,x2,,xn[0,1].

Remark 2.2

[Citation1, Propositions 1.4.8, Remarks 2.1.4(vii) and 2.2.5(vii)].

It is easy to prove that if ϕΦ and T is a t-norm, S is a t-conorm and N is a fuzzy negation (respectively strict, strong), then Tϕ is a t-norm, Sϕ is a t-conorm and Nϕ is a fuzzy negation (respectively strict, strong).

Definition 2.7

[Citation1,Citation2]

A function I:[0,1]2[0,1] is called a fuzzy implication if (I1) I is decreasing with respect to the first variable,(I1) (I2) I is increasing with respect to the second variable,(I2) (I3) I(0,0)=1,(I3) (I4) I(1,1)=1,(I4) (I5) I(1,0)=0.(I5)

Definition 2.8

[Citation1,Citation10]

A fuzzy implication I is said to satisfy

  1. the left neutrality property, if (NP) I(1,y)=y,y[0,1],(NP)

  2. the exchange principle, if (EP) I(x,I(y,z))=I(y,I(x,z)),x,y,z[0,1].(EP)

  3. the identity principle, if (IP) I(x,x)=1,x[0,1],(IP)

  4. the ordering property, if (OP) I(x,y)=1xy,x,y[0,1].(OP)

  5. the left ordering property, if (LOP) xyI(x,y)=1,x,y[0,1].(LOP)

  6. the right ordering property, if (ROP) x>yI(x,y)1,x,y[0,1].(ROP)

Remark 2.3

[Citation1, Proposition 1.1.8].

It is proved that, if ϕΦ and I:[0,1]2[0,1] is a fuzzy implication, then Iϕ is also a fuzzy implication.

Definition 2.9

[Citation1, page 223].

A fuzzy implication I is said to satisfy the law of importation with respect to a t-norm T, if (LI) I(T(x,y),z)=I(x,I(y,z)),x,y,z[0,1].(LI)

Remark 2.4

[Citation1, Remark 7.3.1].

It can be immediately seen that if a fuzzy implication I satisfies (LI) with respect to any t-norm T, by the commutativity of the t-norm T, we have that I satisfies (EP).

Definition 2.10

[Citation1, Lemma 1.4.14 and Definition 1.4.15].

Let I:[0,1]2[0,1] be a fuzzy implication. The function NI:[0,1][0,1] defined by NI(x)=I(x,0),x[0,1]. is called the natural negation of I.

Definition 2.11

[Citation1,Citation6]

A function I:[0,1]2[0,1] is called an (S,N) implication if there exist a t-conorm S and a fuzzy negation N such that (4) I(x,y)=S(N(x),y),x,y[0,1].(4) Moreover, if I is an (S,N) implication generated from S and N, then we will often denote it by IS,N.

Proposition 2.2

[Citation1, Definition 2.4.3(i)]

If IS,N is an (S,N) implication, then it satisfies (NP) and (EP).

3. (T,N) and (N,T,N) Implications

In this section we investigate the properties of (T,N) and (N,T,N) implications.

Definition 3.1

[Citation10, Proposition 3.1 and Definition 3.1].

A function I:[0,1]2[0,1] is called a (T,N) implication if there exist a t-norm T and a fuzzy negation N such that (5) I(x,y)=N(T(x,N(y)),x,y[0,1].(5) Moreover, if I is a (T,N) implication generated from T and N, then we will often denote it by ITN.

Definition 3.2

[Citation13, Proposition 3.1 and Definition 3.2].

A function I:[0,1]2[0,1] is called an (N,T,N) implication if there exist a t-norm T and two fuzzy negations N, N such that (6) I(x,y)=N(T(x,N(y)),x,y[0,1].(6) Moreover, if I is an (N,T,N) implication generated from T, N and N, then we will often denote it by IT,NN.

Definition 3.3

[Citation6, page 232].

Let N be a strict negation, S be a t-conorm and T be a t- norm, such that S(x,y)=N1(T(N(x),N(y))),x,y[0,1]. Then S is said to be the N dual of T and we denote it by ST,N. In the case that N is a strong negation, then ST,N(x,y)=N(T(N(x),N(y))),x,y[0,1].

The above Definition 3.3 addresses that a (T,N) implication generated from a strong negation N is always an (S,N) implication and more specific it is ITN=IST,N,N. Thus, the properties of (T,N) implications generated from strong negations N are the same with them of (S,N) implications, as they are studied in [Citation1, Section 2.4]. So, a (T,N) implication generated from a strong negation N always satisfies (NP) and (EP) according to Proposition 2.2. We get the same results for the (N,T,N) implication IT,(N)1N (where N is strict) according to the following Proposition 3.1.

Proposition 3.1

Let IT,NN be an (N,T,N) implication generated from t-norm T and two strict fuzzy negations N, N, such that (N)1=N. Then IT,NN is an (S,N) implication. Moreover, it is IT,NN=IST,(N)1,N.

Proof.

Since N is a strict fuzzy negation, then it is a bijection. So there exists the fuzzy negation (N)1. Moreover, if (N)1=N then for all x,y[0,1] it is IT,NN(x,y)=(N)1=NIT,(N)1N(x,y)=N(T(x,(N)1(y)))=((N)1)1(T((N)1(N(x)),(N)1(y)))=ST,(N)1(N(x),y)=IST,(N)1,N(x,y). Thus IT,NN is an (S,N) implication. Moreover, it is IT,NN=IT,(N)1N=IST,(N)1,N.

Proposition 3.2

[Citation13, Proposition 3.4(i)]

Let IT,NN be an (N,T,N) implication. Then NIT,NN=N.

Remark 3.1

Note that if N=N the corresponding (N,T,N) implication is a (T,N) implication. More specific IT,NN=ITN and NITN=N.

3.1. (T,N), (N,T,N) Implications and the Neutrality Property (NP)

In this section, we investigate whether or not, (T,N) and (N,T,N) implications satisfy (NP).

Proposition 3.3

Let ITN be a (T,N) implication.

(i)

If N is strong, then ITN satisfies (NP).

(ii)

If N is not strong, then ITN violates (NP).

Proof.

(i) Since N is a strong negation then ITN=IST,N,N. Thus ITN is an (S,N) implication and it satisfies (NP) according to Proposition 2.2.

(ii) It is proved in Proposition 3.3(i) in [Citation10].

The above Proposition 3.3 is very important, because it fully characterizes the intersection between the sets of (S,N) and (T,N) implications. This characterization is addressed in [Citation12] Figure .

Figure 1. Intersection between (S,N)- and (T,N)-implications.

Figure 1. Intersection between (S,N)- and (T,N)-implications.

Proposition 3.4

[Citation13, Proposition 3.4(i)]

Let IT,NN be an (N,T,N) implication. Then IT,NN satisfies (NP), if and only if NN=Id[0,1].

The above Proposition 3.4 is very important. According to the Lemma 2.1 if NN=Id[0,1], then

  1. N is a continuous fuzzy negation,

  2. N is a strictly decreasing fuzzy negation.

Therefore, the following Corollaries are presented without proofs, since they are obvious.

Corollary 3.5

Let IT,NN be an (N,T,N) implication, where N is not a continuous fuzzy negation. Then IT,NN violates (NP).

Corollary 3.6

Let IT,NN be an (N,T,N) implication, where N is not strictly decreasing. Then IT,NN violates (NP).

Corollary 3.7

Let IT,NN be an (N,T,N) implication, where at least one of N and N is a crisp fuzzy negation. Then IT,NN violates (NP).

Proof.

If N is a crisp fuzzy negation, then it is not strictly decreasing and according to the Corollary 3.6, the corresponding IT,NN violates (NP).

If N is a crisp fuzzy negation, then it is not continuous and according to the Corollary 3.5, the corresponding IT,NN violates (NP).

Remark 3.2

  1. Corollaries 3.5 and 3.6 are very important. Note that, they prove that if N is not a strictly decreasing fuzzy negation, or N is not a continuous fuzzy negation, then the corresponding IT,NN is not an (S,N) implication according to Proposition 2.2.

  2. Corollary 3.7 is also very important. Note that, it proves that if at least one of N and N is a crisp fuzzy negation, then the corresponding IT,NN is not an (S,N) implication according to Proposition 2.2.

  3. Proposition 3.3 can be deduced by Proposition 3.4.

3.2. (T,N), (N,T,N) Implications and the Exchange Principle (EP)

In this section, we investigate whether or not, (T,N) and (N,T,N) implications satisfy (EP).

Proposition 3.8

Let ITN be a (T,N) implication.

(i)

If N is strong, then ITN satisfies (EP).

(ii)

If N is a crisp fuzzy negation, then ITN satisfies (EP).

(iii)

If N is strict, but not strong, then ITN violates (EP).

Proof.

(i) Since N is a strong negation then ITN=IST,N,N. Thus ITN is an (S,N) implication and it satisfies (EP) according to Proposition 2.2.

(ii) It is proved in Theorem 3.2(i) in [Citation10].

(iii) It is proved in Proposition 3.3(ii) in [Citation10].

Proposition 3.9

[Citation13, Proposition 3.5]

Let IT,NN be an (N,T,N) implication. If NN=Id[0,1], then IT,NN satisfies (EP).

Proposition 3.10

[Citation13, Proposition 3.9(i)]

Let IT,NN be an (N,T,N) implication, where N and N are crisp fuzzy negations. Then IT,NN satisfies (EP).

Proposition 3.11

Let IT,NN be an (N,T,N) implication. If IT,NN satisfies (EP), then NNN=N.

Proof.

Since IT,NN satisfies (EP), then for all x[0,1] it is IT,NN(1,IT,NN(x,0))=IT,NN(x,IT,NN(1,0))(I5)IT,NN(1,N(T(x,N(0))))=IT,NN(x,0)IT,NN(1,N(T(x,1)))=N(T(x,N(0)))IT,NN(1,N(T(x,1)))=N(T(x,1))(T4)IT,NN(1,N(x))=N(x)N(T(1,N(N(x)))=N(x)(T4)N(N(N(x)))=N(x).

Corollary 3.12

Let ITN be a (T,N) implication generated from a non- strong negation N. If ITN satisfies (EP), then N(N(N(x)))=N(x), for all x[0,1].

Proof.

It is deduced by Proposition 3.11, for N=N.

Proposition 3.13

Let IT,NN be an (N,T,N) implication, where N is strictly decreasing with a fixed point. If N does not have any fixed point, or N and N have different fixed points, then IT,NN violates (EP).

Proof.

We assume that IT,NN satisfies (EP). Therefore, from Proposition 3.11, we deduce that for all x[0,1] it is (NNN)(x)=N(x). Since N has a fixed point (this is unique since N is strictly decreasing, therefore it is an injection), there is an e(0,1) such that N(e)=e. So, (NNN)(e)=N(e)N(N(N(e)))=N(e)N(e)=eN(N(e))=N(e)injectionNN(e)=e. So, N and N have the same fixed point. That is a contradiction, therefore, IT,NN violates (EP).

Remark 3.3

  1. Proposition 3.11 gives us the sufficient condition, that if there is an x0(0,1) such that N(N(N(x0)))N(x0), then IT,NN violates (EP). This result in the case of (T,N) implications, where N=N is transformed to the sufficient condition, that if there is an x0(0,1) such that N(N(N(x0)))N(x0), then ITN violates (EP).

  2. Note that, if there is an x0(0,1) such that N(N(N(x0)))N(x0), then N is not a strong fuzzy negation.

  3. According to [Citation1] Theorem 1.4.7, every continuous fuzzy negation N has a unique fixed point. Therefore, Proposition 3.13 holds if N is strict, N is continuous and they have different fixed points.

Proposition 3.14

Let IT,NN be an (N,T,N) implication, where N is a strictly decreasing fuzzy negation. The following statements are equivalent:

(i)

IT,NN satisfies (EP).

(ii)

NN=Id[0,1].

Proof.

(i)⇒(ii)

Since IT,NN satisfies (EP), then from Proposition 3.11, we deduce that for all x[0,1] it is N(N(N(x)))=N(x). Moreover, N is an injection, since it is a strictly decreasing function. So, for any x[0,1] it is N(N(N(x)))=N(x)N(N(x))=xNN=Id[0,1]. (ii)⇒(i)

It is deduced by Proposition 3.9.

According to the Lemma 2.1, if NN=Id[0,1], then N is a continuous fuzzy negation. Therefore, by Proposition 3.14, we deduce the following Corollary without proof, since is is obvious.

Corollary 3.15

Let IT,NN be an (N,T,N) implication, where N is not a continuous fuzzy negation and N is a strictly decreasing fuzzy negation. Then IT,NN violates (EP).

A very helpful Theorem is the following.

Theorem 3.16

[Citation1, Theorem 2.4.10]

For a function I:[0,1]2[0,1] the following statements are equivalent:

(i)

I is an (S,N) implication with a continuous fuzzy negation N.

(ii)

I satisfies (I1), (EP) and NI is a continuous fuzzy negation.

The above Theorem 3.16 helps to the proof of the following Propositions.

Proposition 3.17

Let IT,NN be an (N,T,N) implication, where N is a continuous fuzzy negation and N is not a strictly decreasing fuzzy negation. Then IT,NN violates (EP).

Proof.

We assume that IT,NN satisfies (EP). By Proposition 3.2 it is deduced that N=NIT,NN. Also, N is a continuous fuzzy negation, by the hypothesis. Moreover, since IT,NN is a fuzzy implication, it satisfies (I1). So, IT,NN satisfies the statement (ii) in Theorem 3.16. By virtue of Theorem 3.16, we deduce that IT,NN is an (S,N) implication. Thus, IT,NN satisfies (NP), according to Proposition 2.2. So, by Proposition 3.4 it must be NN=Id[0,1]. This means that N is strictly decreasing according to Lemma 2.1. That is a contradiction, since N is not strictly decreasing. Thus, IT,NN violates (EP).

Proposition 3.18

Let ITN be a (T,N) implication generated from a continuous non- strong negation N. Then ITN violates (EP).

Proof.

We assume that ITN satisfies (EP). By Remark 3.1, it is deduced that N=NITN. Also, N is a continuous fuzzy negation, by the hypothesis. Moreover, since ITN is a fuzzy implication, it satisfies (I1). So, ITN satisfies the statement (ii) in Theorem 3.16. By virtue of Theorem 3.16, we deduce that ITN is an (S,N) implication. Thus, ITN satisfies (NP), according to Proposition 2.2. That is a contradiction according to Proposition 3.3(ii), since N is not strong. Thus, ITN violates (EP).

Corollary 3.19

Let ITN be a (T,N) implication generated from a strictly decreasing non- strong negation N. Then ITN violates (EP).

Proof.

Since N is a non- strong negation, there is an x0(0,1), such that N(N(x0))x0. We assume that ITN satisfies (EP), than by virtue of Proposition 3.14 it is NN=Id[0,1], i.e. N is a strong negation. That is a contradiction. Thus, ITN violates (EP).

Remark 3.4

Proposition 3.8(iii) can be deduced by Proposition 3.18 or Corollary 3.19.

3.3. (T,N), (N,T,N) Implications and the Identity Principle (IP)

In this section, we investigate whether (T,N) and (N,T,N) implications satisfy (IP).

Proposition 3.20

Let IT,NN be an (N,T,N) implication. Moreover, let the pair (T,N) satisfies (LC). Then IT,NN satisfies (IP).

Proof.

For all x[0,1] it is IT,NN(x,x)=N(T(x,N(x)))=(T1)N(T(N(x),x))=(LC)N(0)=1.

Corollary 3.21

If ITN is a (T,N) implication and the pair (T,N) satisfies (LC), then ITN satisfies (IP).

Proof.

Note that it is Proposition 3.20, where N=N.

Proposition 3.22

Let IT,NN be an (N,T,N) implication, where N is a non- filling fuzzy negation. Then the following statements are equivalent:

(i)

The pair (T,N) satisfies (LC)).

(ii)

IT,NN satisfies (IP).

Proof.

(i) ⇒ (ii)

It is deduced by Proposition 3.20.

(ii)⇒ (i)

Let IT,NN satisfies (IP). Then for all x[0,1] it is IT,NN(x,x)=1N(T(x,N(x)))=1nonfillingNT(x,N(x))=0(T1)T(N(x),x)=0. Thus the pair (T,N) satisfies (LC).

Corollary 3.23

Let ITN be a (T,N) implication generated from a non- filling fuzzy negation N. Then the following statements are equivalent:

(i)

The pair (T,N) satisfies (LC).

(ii)

ITN satisfies (IP).

Proof.

Note that it is Proposition 3.22, where N=N.

In the case, we use a crisp fuzzy negation we get the following (N,T,N) implications. (7) IT,NNα(x,y)=0,if T(x,N(y))α1,otherwise ,(7) (8) IT,NNα(x,y)=0,if T(x,N(y))>α1,otherwise,(8) (9) IT,NαN(x,y)=1,if yαN(x),otherwise ,(9) and (10) IT,NαN(x,y)=1,if y>αN(x),otherwise .(10)

Proposition 3.24

Let IT,NN be an (N,T,N) implication, where N is a crisp fuzzy negation. If the pair (T,N) satisfies (LC), then IT,NN satisfies (IP).

Proof.

Let N=Nα. For all x[0,1], it is IT,NNα(x,y)=(7)0,if T(x,N(y))α1,otherwise ,α(0,1]. Moreover, the pair (T,N) satisfies (LC). So, for all x[0,1], it is T(x,N(x))=0<α(0,1]IT,NNα(x,x)=1. Thus, IT,NNα satisfies (IP).

Let N=Nα. For all x[0,1], it is IT,NNα(x,y)=(8)0,if T(x,N(y))>α1,otherwise ,α[0,1). Moreover, the pair (T,N) satisfies (LC). So, for all x[0,1], it is T(x,N(x))=0α[0,1)IT,NNα(x,x)=1. Thus, IT,NNα satisfies (IP).

Remark 3.5

(i) It is easy to prove that IT,NβNα, IT,NβNα and IT,NβNα satisfy (IP), if and only if αβ, since (11) IT,NβNα(x,y)=(10)1,if y>βNα(x),otherwise =0,if yβandx>α1,otherwise ,(11) where α,β[0,1), (12) IT,NβNα(x,y)=(9)1,if yβNα(x),otherwise =0,if y<βandx>α1,otherwise ,(12) where α[0,1) and β(0,1], (13) IT,NβNα(x,y)=(9)1,if yβNα(x),otherwise =0,if y<βandxα1,otherwise ,(13) where α,β(0,1].

(ii) From (Equation11) and (Equation13), for α=β we deduce that a (T,N) implication generated from a crisp fuzzy negation satisfies (IP).

(iii) It is easy to prove that IT,NβNα satisfies (IP), if and only if α>β, since (14) IT,NβNα(x,y)=(10)1,if y>βNα(x),otherwise =0,if yβandxα1,otherwise ,(14) where α(0,1] and β[0,1).

3.4. (T,N), (N,T,N) Implications and the Ordering Property (OP)

In this section, we investigate whether or not, (T,N) and (N,T,N) implications satisfy (OP). Sometimes (OP) is divided in two sub- properties, the so-called (LOP) and (ROP). It is easy to observe that, if a fuzzy implication I satisfies both (LOP) and (ROP), it satisfies (OP).

Proposition 3.25

[Citation10, Theorem 3.2 and Remark 3.2]

Let ITN be a (T,N) implication generated from a crisp fuzzy negation. Then ITN satisfies (LOP) and violates (ROP) and (OP).

Proposition 3.26

[Citation13, Proposition 3.9(iii),(v)]

Let IT,NN be an (N,T,N) implication, where N, N are crisp fuzzy negations.

(i)

IT,NN satisfies (LOP) if and only if NN.

(ii)

IT,NN does not satisfy (ROP).

A direct conclusion from Proposition 3.26 is the following.

Corollary 3.27

Let IT,NN be an (N,T,N) implication, where N, N are crisp fuzzy negations. Then IT,NN violates (OP).

Proposition 3.28

Let IT,NN be an (N,T,N) implication. Moreover, let the pair (T,N) satisfies (LC). Then IT,NN satisfies (LOP).

Proof.

For all x,y[0,1], such that xy it is N(x)N(y), since N is decreasing. So, xyN(x)N(y)(T3)T(x,N(x))T(x,N(y))(T1)T(N(x),x)T(x,N(y))(LC)0T(x,N(y))(Definition~{2})T(x,N(y))=0N(T(x,N(y)))=N(0)IT,NN(x,y)=1. Thus, IT,NN satisfies (LOP).

Proposition 3.29

Let IT,NN be an (N,T,N) implication generated from strictly decreasing fuzzy negations N, N and a strictly monotone t- norm T such that, the pair (T,N) satisfies (LC). Then IT,NN satisfies (ROP).

Proof.

For all x,y[0,1], such that x>y it is x>0 and N(x)<N(y), since N is strictly decreasing. So, x>yN(x)<N(y)T(x,N(x))<T(x,N(y)), since T is strictly monotone. By virtue of (T1) we have T(N(x),x)<T(x,N(y))(LC)0<T(x,N(y))N(0)>N(T(x,N(y)))1>IT,NN(x,y)IT,NN(x,y)1, since N is strictly decreasing. Thus, IT,NN satisfies (ROP).

Corollary 3.30

Let IT,NN be an (N,T,N) implication generated from strictly decreasing fuzzy negations N, N and a strictly monotone t-norm T such that, the pair (T,N) satisfies (LC). Then IT,NN satisfies (OP).

Proof.

It is deduced by virtue of Propositions 3.28 and 3.29.

Corollary 3.31

Let ITN be a (T,N) implication.

(i)

If the pair (T,N) satisfies (LC), then ITN satisfies (LOP).

(ii)

If N is strictly decreasing fuzzy negation and the t-norm T is strictly monotone such that, the pair (T,N) satisfies (LC), then ITN satisfies (ROP) and (OP).

Proof.

(i) Note that it is Proposition 3.28 for N=N.

(ii) Note that it is an application of Proposition 3.29 and Corollary 3.30 for N=N.

3.5. (T,N), (N,T,N) Implications and the Law of Importation (LI)

In this section, we study whether or not, (T,N) and (N,T,N) implications satisfy the law of importation (LI) with respect to any, or which, t-norm T.

Proposition 3.32

Let IT,NN be an (N,T,N) implication. If NN=Id[0,1], then the couple of functions IT,NN and T satisfies (LI). Moreover, this couple of functions is unique, i.e. for any other t-norm T the couple of functions IT,NN and T violates (LI).

Proof.

For all x,y,z[0,1], it is IT,NN(T(x,y),z)=N(T(T(x,y),N(z)))=(T2)N(T(x,T(y,N(z))))=NN=Id[0,1]N(T(x,N(N(T(y,N(z))))))=IT,NN(x,IT,NN(y,z)). Thus, the couple of functions IT,NN and T satisfies (LI).

We assume that, there is an other t-norm T, such that the couple of functions IT,NN and T satisfies (LI). Then, for all x,y,z[0,1], it is IT,NN(T(x,y),z)=IT,NN(x,IT,NN(y,z))=IT,NN(T(x,y),z). So, N(T(T(x,y),N(z)))=N(T(T(x,y),N(z)))N(N(T(T(x,y),N(z))))=N(N(T(T(x,y),N(z))))NN=Id[0,1]T(T(x,y),N(z))=T(T(x,y),N(z)). Putting z = 0 we have T(T(x,y),N(0))=T(T(x,y),N(0))T(T(x,y),1)=T(T(x,y),1)(T4)T(x,y)=T(x,y), that is a contradiction, since TT.

Corollary 3.33

Let ITN be a (T,N) implication generated from a t-norm T and a strong negation N. The couple of functions ITN and T satisfies (LI). Moreover, this couple of functions is unique, i.e. for any other t-norm T the couple of functions ITN and T violates (LI).

Proof.

Note that it is Proposition 3.32 since N is strong, therefore NN=Id[0,1].

Corollary 3.34

Let IT,(N)1N be an (N,T,N) implication, where N is a strict fuzzy negation. Then the couple of functions IT,(N)1N and T satisfies (LI). Moreover, this couple of functions is unique.

Proof.

The proof is deduced by Proposition 3.32 since (N)1N=Id[0,1].

Proposition 3.35

Let IT,NN be an (N,T,N) implication. Let there is an x0(0,1) such that N(N(N(x0)))N(x0). Then there is not any t-norm T, such that the couple of functions IT,NN and T satisfies (LI).

Proof.

Consider that there is a t-norm T, such that the couple of functions IT,NN and T satisfies (LI). Then, by Remark 2.4 follows that IT,NN satisfies (EP), a contradiction by virtue of Remark 3.3(i).

Corollary 3.36

Let ITN be a (T,N) implication generated from a non- strong negation N. Moreover, there is an x0(0,1) such that N(N(N(x0)))N(x0). Then there is not any t-norm T, such that the couple of functions ITN and T satisfies (LI).

Proof.

Note that N=N and apply Proposition 3.35.

Proposition 3.37

Let IT,NN be an (N,T,N) implication, where N is strictly decreasing with a fixed point. If N does not have any fixed point, or N and N have different fixed points, then there is not any t-norm T, such that the couple of functions IT,NN and T satisfies (LI).

Proof.

Consider that there is a t-norm T, such that the couple of functions IT,NN and T satisfies (LI). Then, by Remark 2.4 follows that IT,NN satisfies (EP), a contradiction by virtue of Proposition 3.13.

Proposition 3.38

Let IT,NN be an (N,T,N) implication, where N is a strictly decreasing fuzzy negation. The following statements are equivalent:

(i)

IT,NN satisfies (EP).

(ii)

The couple of functions IT,NN and T satisfies (LI) and this couple of functions is unique.

(iii)

NN=Id[0,1].

Proof.

(i)⇔(iii)

See Proposition 3.14.

(ii)⇒(i)

See Remark 2.4.

(iii)⇒(ii)

See Proposition 3.32.

Proposition 3.39

Let IT,NN be an (N,T,N) implication, where N is not a continuous fuzzy negation and N is a strictly decreasing fuzzy negation. Then there is not any t- norm T, such that the couple of functions IT,NN and T satisfies (LI).

Proof.

Consider that there is a t- norm T, such that the couple of functions IT,NN and T satisfies (LI). Then, by Remark 2.4 follows that IT,NN satisfies (EP), a contradiction by virtue of Corollary 3.15.

Proposition 3.40

Let ITN be a (T,N) implication generated from a continuous non- strong negation N. Then there is not any t-norm T, such that the couple of functions ITN and T satisfies (LI).

Proof.

Consider that there is a t- norm T, such that the couple of functions ITN and T satisfies (LI). Then, by Remark 2.4 follows that ITN satisfies (EP), a contradiction by virtue of Proposition 3.18.

Proposition 3.41

Let ITN be a (T,N) implication generated from a strictly decreasing non- strong negation N. Then there is not any t-norm T, such that the couple of functions ITN and T satisfies (LI).

Proof.

Consider that there is a t-norm T, such that the couple of functions ITN and T satisfies (LI). Then, by Remark 2.4 follows that ITN satisfies (EP), a contradiction by virtue of Corollary 3.19.

Proposition 3.42

Let IT,NNα be an (N,T,N) implication, generated from a t-norm T and two crisp fuzzy negations Nα and N. The couple of functions IT,NNα and T satisfies (LI) if and only if min{x,y}αT(x,y)α.

Proof.

Let N=Nβ. It is IT,NβNα(x,y)=(13)0,if y<βandxα1,otherwise . Let T be any t-norm. For all x,y,z[0,1], it is IT,NβNα(T(x,y),z)=0,if z<βandT(x,y)α1,otherwise  and IT,NβNα(x,IT,NβNα(y,z))=IT,NβNα(x,0),if z<βandyαIT,NβNα(x,1),otherwise =β(0,1]0,if z<βandxαandyα1,otherwise . It is easy to prove that for any t-norm T and x,y[0,1], it is T(x,y)x and T(x,y)y (see [17, Proposition 9]). So we deduce that (15) T(x,y)αxαandyαmin{x,y}α.(15) “⇒”

We assume that the couple of functions IT,NβNα and T satisfies (LI). It must be for any x,y,z[0,1], IT,NβNα(T(x,y),z)=IT,NβNα(x,IT,NβNα(y,z))0,if z<βandT(x,y)α1,otherwise =0,if z<βandxαandyα1,otherwise (T(x,y)αxαandyα)(T(x,y)αmin{x,y}α)(15)(min{x,y}αT(x,y)α). “⇐”

We assume that (min{x,y}αT(x,y)α)(xαandyαT(x,y)α) this means, that T(x,y)αxαandyα. By the above equivalence, we conclude that IT,NβNα(T(x,y),z)=0,if z<βandT(x,y)α1,otherwise =0,if z<βandxαandyα1,otherwise =IT,NβNα(x,IT,NβNα(y,z)). Thus, the couple of functions IT,NβNα and T satisfies (LI). If we assume that N=Nβ. the proof is similar. So it is omitted.

Proposition 3.43

Let IT,NNα be an (N,T,N) implication, generated from a t-norm T and two crisp fuzzy negations Nα and N. The couple of functions IT,NNα and T satisfies (LI) if and only if min{x,y}>αT(x,y)>α.

Proof.

The proof is similar with the proof of Proposition 3.42. So it is omitted.

Remark 3.6

  1. It is obvious that Proposition 3.42 (respectively Proposition 3.43) holds for (T,N) implications generated from a t-norm T and a crisp fuzzy negation Nα (respectively, Nα).

  2. From Propositions 3.42 and 3.43 we deduce that an (N,T,N) implication (respectively, a (T,N) implication) generated from crisp fuzzy negations (respectively negation) always satisfies (LI) with respect to the minimum t- norm TM(x,y)=min{x,y}.

  3. From Proposition 3.42 we deduce that IT,NN1, where N is a crisp fuzzy negation satisfies (LI) with respect to any t-norm T.

  4. From Proposition 3.43 we deduce that IT,NN0, where N is a crisp fuzzy negation satisfies (LI) with respect to any strictly monotone t-norm T.

  5. Proposition 3.10 can be deduced by Remarks 3.6(ii) and 2.4.

3.6. (N,T,N) Implications and Φ- Conjugacy Classes

Theorem 3.44

If ϕΦ and IT,NN is an (N,T,N) implication, then (IT,NN)ϕ is an (N,T,N) implication and moreover (IT,NN)ϕ=ITϕ,NϕNϕ.

Proof.

Let IT,NN be an (N,T,N) implication, then (IT,NN)ϕ is an (N,T,N) implication according to the Remark 2.3. Moreover, for all x,y[0,1], we deduce that (IT,NN)ϕ(x,y)=ϕ1(IT,NN(ϕ(x),ϕ(y)))=ϕ1(N(T(ϕ(x),N(ϕ(y)))))=ϕ1(N(ϕ(ϕ1(T(ϕ(x),ϕ(ϕ1(N(ϕ(y)))))))))=Nϕ(Tϕ(x,Nϕ(y))=ITϕ,NϕNϕ(x,y).

4. Final Remarks

In this study, we dealt with (T,N) implications and (N,T,N) implications, which are a generalization of (T,N) implications. Firstly, we connected a form of (N,T,N) implications with (S,N) implications and we investigated when an (N,T,N) implication satisfies, or not, (NP). In the following, the conditions under an (N,T,N) implication (respectively a (T,N) implication) satisfies or violates (EP) have been studied. A study for the satisfaction of (IP) and the satisfaction or violation of (OP) has also been made. Furthermore, except the basic properties of fuzzy implications we expanded our study to the law of importation (LI) with respect to a t-norm T. Our study focused, not only to the satisfaction of violation of (LI) with respect to a t-norm T, but also to the uniqueness, or not of the t-norm T. Moreover, the sufficient and necessary conditions under an (N,T,N) implication (respectively a (T,N) implication), generated from crisp fuzzy negations (respectively a crisp fuzzy negation), satisfies (LI) with respect to a t-norm T were presented and proved. Also, the relation of Φconjugation in (N,T,N) implications was studied.

Disclosure Statement

No potential conflict of interest was reported by the author(s).

Data Availability Statement

No data were used to support this study.

Additional information

Notes on contributors

Dimitrios S. Grammatikopoulos

Dimitrios S. Grammatikopoulos is with the Department of Civil Engineering, School of Engineering at Democritus University of Thrace, Greece. He received his Bachelor degree in Mathematics in 2005 and his MSc in Statistics and Operational Research in 2008, both from the Department of Mathematics at Aristotle University of Thessaloniki, Greece. He received his second MSc in Applied Mathematics in 2018, from the School of Engineering at Democritus University of Thrace, Greece. His research interests include fuzzy theory and systems with applications. He is currently working towards his PhD degree.

Basil K. Papadopoulos

Basil K. Papadopoulos is currently a Professor at the Department of Civil Engineering, School of Engineering at Democritus University of Thrace, Greece. He is also the Director of the MSc in Applied Mathematics at the School of Engineering at Democritus University of Thrace, Greece. For more information, please visit his webpage: http://utopia.duth.gr/papadob/.

References