Skip to main content
Elsevier - PMC COVID-19 Collection logoLink to Elsevier - PMC COVID-19 Collection
. 2020 Aug 12;126:1–26. doi: 10.1016/j.ijar.2020.07.002

n-Dimensional (S,N)-implications

Rosana Zanotelli a, Renata Reiser a, Benjamin Bedregal b,
PMCID: PMC7422844  PMID: 32834472

Abstract

The n-dimensional fuzzy logic (n-DFL) has been contributed to overcome the insufficiency of traditional fuzzy logic in modeling imperfect and imprecise information, coming from different opinions of many experts by considering the possibility to model not only ordered but also repeated membership degrees. Thus, n-DFL provides a consolidated logical strategy for applied technologies since the ordered evaluations provided by decision makers impact not only by selecting the best solutions for a decision making problem, but also by enabling their comparisons. In such context, this paper studies the n-dimensional fuzzy implications (n-DI) following distinct approaches: (i) analytical studies, presenting the most desirable properties as neutrality, ordering, (contra-)symmetry, exchange and identity principles, discussing their interrelations and exemplifications; (ii) algebraic aspects mainly related to left- and right-continuity of representable n-dimensional fuzzy t-conorms; and (iii) generating n-DI from existing fuzzy implications. As the most relevant contribution, the prospective studies in the class of n-dimensional interval (S,N)-implications include results obtained from t-representable n-dimensional conorms and involutive n-dimensional fuzzy negations. And, these theoretical results are applied to model approximate reasoning of inference schemes, dealing with based-rule in n-dimensional interval fuzzy systems. A synthetic case-study illustrates the solution for a decision-making problem in medical diagnoses.

Keywords: n-Dimensional intervals; Fuzzy-implications; (S,N)-Implications; n-Dimensional fuzzy sets; Decision-making problems

1. Introduction

Zadeh introduced in 1975 the type-n fuzzy sets [45] (Tn-FSs) whose relevance emerges from the insufficiency of the traditional fuzzy logic (FL) in modeling inherent imperfect information related to distinct opinions of specialists in order to define antecedent and consequent of membership functions in inference systems [18]. Currently, many extensions of fuzzy sets are known, e.g. L-fuzzy sets as proposed by Goguen [23], and the Hesitant Fuzzy Sets introduced by Torra [40], [41].

In [38], the notion of an n-dimensional fuzzy set (n-DFS) on Ln-fuzzy set theory was introduced by Shang as a special class of Tn-FSs, generalizing the theories underlying many other multivalued fuzzy logics: the Interval-valued Fuzzy Sets [24], [37], the Intuitionistic Fuzzy Sets [2], [3] and the Interval-valued Intuitionistic Fuzzy Sets [4]. In Ln-fuzzy set theory [38], the n-dimensional fuzzy sets membership values are n-tuples of real numbers on U=[0,1], ordered in increasing order and called n-dimensional intervals.

Lately, in [14], Bedregal et al. notice that in most applications the Typical Hesitant Fuzzy Elements (THFE) are used, i.e., considering finite and non-empty subsets of unitary interval (U=[0,1]) as hesitant fuzzy degrees. In addition, even when the repetition of element in n-tuples on the hesitant membership degrees is not considered, they can be defined as a THFE [14]. For a hierarchical and historical analysis of these extensions see [18].

According to [11], the main idea of an n-dimensional fuzzy set is to consider several uncertainty levels in the memberships functions, adding degrees of freedom and making it possible to directly model uncertainties in computational systems based on nDFL. Such uncertainties are frequently associated to systems where time-varying, non-stationary statistical attributes or knowledge of experts using questionnaires, all of them include uncertain words from natural language.

The fuzzy implication class plays an important role in modeling fuzzy conditionals [7], [8], covering a wide range of distinct fields, from theoretical to applied research areas. In a broad sense, such class is frequently applied to fuzzy control by techniques of soft-computing and analysis of vagueness in natural language modeled by linguistic fuzzy models [44]. Such class is carrying out all inference processes in any fuzzy rule based system [43]. The analysis of properties of fuzzy implications also contributes to underlying applied research areas such as Approximate Reasoning (AR) [29], [28]. In the narrow sense, the study of fuzzy implication properties contributes to a branch of many-valued logic enabling the investigation of deep logical questions [1].

In this paper, both approaches are considered, and for that, various properties of n-dimensional fuzzy implications are investigating, including the study of negations (n-DN) and aggregation operators as t-conorms (n-DS) and their dual constructions on Ln(U). Thus, by making use of the representability of such n-dimensional fuzzy connectives, we are able to extend relevant theoretical results from fuzzy connectives to n-dimensional fuzzy approach.

Focusing on the (S,N)-implication class, representable n-dimensional t-conorms in conjunction with representable n-dimensional strong fuzzy negations are also studied. In particular, several (S,N)-implication properties are also investigated. Finally, we formalize an inference scheme considering the use n-DI, providing an n-dimensional interval fuzzy rule-based expert system. Based on inference schemes, the reasoning method consists on a knowledge base of If-Then rules defined by a binary fuzzy relation on Ln(U), which is stated by representable n-dimensional interval (S,N)-implications.

An application in Approximate Reasoning is also introduced, as methods enabling reasoning with imprecise inputs to obtain meaningful outputs applying n-dimensional interval fuzzy implications.

Our studies contribute with distinct and relevant results:

  • (i)

    Consolidating the extension of fuzzy implication on Ln(U), also exploring their representability based on fuzzy implications on U;

  • (ii)

    Exploring main properties, as identity, neutrality and exchange principles, the iterative Boolean-like law, the dominance of falsity, among additional ones, showing that they can be preserved from U on Ln(U).

  • (iii)

    Discussing constructions and several examples of continuous fuzzy implications on Ln(U), including concepts as left- and right-continuity w.r.t. the Moore-continuity [33], [34].

  • (iv)

    Exploring properties of n-Dimensional (S,N)-implications, as the Law of Excluded Middle and (Right- or Left-) Contraposition w.r.t. an n-dimensional fuzzy negation, which can be performed over dual operators and also considering the action of automorphisms to obtain conjugate operators.

  • (v)

    Exploring n-dimensional fuzzy (S,N)-implication class in Approximate Reasoning, providing the n-dimensional extension of basic concepts which generalize fuzzy conditional rules;

  • (vi)

    Introducing inference schemes as the Generalized Modus Ponens (GMP), when the knowledge base consists of n-dimensional fuzzy IF-THEN rules [28].

Analogously to the fuzzy approach, based on these results, the use of n-dimensional (S,N)-implications can play a similar role in the generalizations of the inference schemes, where reasoning is done with fuzzy statements whose truth-values lie in Ln(U) [7], [21].

1.1. Related papers

In [38], the definitions of cut set on an n-dimensional fuzzy set and its corresponding n-dimensional vector level cut set are presented according to Zadeh fuzzy set approach. It also studies the decomposition and representation theorems of the n-dimensional fuzzy sets.

The construction of bounded lattice negations from bounded lattice t-norms is considered in [12], together with a discussion under which these connective conditions are preserved by automorphisms and corresponding conjugate negations and t-norms.

In [11], the authors consider the study of aggregation operators for these new concepts of n-dimensional fuzzy sets, starting from the usual aggregation operator theory and also including a new class of aggregation operators containing an Ln(U)-extension of the OWA operator. The results presented in such context allow to extend fuzzy sets to interval-valued Atanassov's intuitionistic fuzzy sets and also preserve their main properties.

The results in [31] provide the class of representable n-dimensional strict fuzzy negations, i.e., an n-dimensional strict fuzzy negation which is determined by strict fuzzy negations.

The authors in [32] and [15] consider the definitions and results obtained for n-dimensional fuzzy negations, applying these studies mainly on natural n-dimensional fuzzy negations for n-dimensional t-norms and n-dimensional t-conorms. And, in [33] Moore Continuous n-dimensional interval fuzzy negations are also discussed.

In [30] the triples formed by a t-norm, t-conorm and standard complement are called De Morgan triples if it fulfills De Morgan laws. Some new important results about t-norm and t-conorm theory are discussed and many of them are not readily found in the literature.

More recently, we can highlight an n-dimensional interval extension of uninorms in [34], a preliminary study in the class of n-dimensional R-implications obtained from representable n-dimensional t-norms is discussed in [47] and the inference schemes making use of n-dimensional fuzzy logic in [48].

Following the results above cited, this paper studies the possibility of dealing with main properties of representable n-dimensional S-implications on Ln(U), exploring their main properties.

1.2. Outline of the paper

The remaining of the paper is set as follows. Section 2 introduces some definitions needed throughout this paper, reporting the main characteristics of fuzzy negations, t-conorms and fuzzy implications.

The concepts structuring the distributive complete lattice Ln(U) of n-dimensional fuzzy set are reported in Section 3, focusing on the supremum and infimum, both defined w.r.t. the partial natural order, also covering the projection operators and degenerate elements such as the top and bottom elements. In addition, an n-dimensional automorphism on L(U) and their well-known results are both reported.

In Section 4, fuzzy negations on Ln(U) are briefly discussed based on extensions of the main results from [11], including the class of representable and conjugate n-dimensional fuzzy negations.

Section 5 is devoted to the new propositions discussing main properties n-dimensional fuzzy t-conorms, dual and conjugate constructions, projections and examples.

The core of the paper sits in the next three sections. Firstly, in Section 6, the development of the concepts and reasonable properties of n-dimensional fuzzy implications on Ln(U) such as the Moore-continuity, as well as the evidence on properties assuring representability of n-DFI is presented. This section also considers new specific results in the analysis of conjugation operators. In sequence, Section 7 concerns the study of n-dimensional interval fuzzy (S,N)-implications, main characterization of such operators, duality and action of n-dimensional automorphisms. And, Section 7, exploring n-dimensional fuzzy (S,N)-implication in AR, presenting inference schemes, compositional rule-base and exemplification.

The Conclusion highlights main results and briefly comments on further work.

2. Preliminaries

In this section, we will briefly review some basic concepts of FL, concerning the study of n-dimensional intervals, which can be found in [10] and [15].

2.1. Fuzzy negations

A function N:UU is a fuzzy negation (shortly FN) if

  • N1

    N(0)=1 and N(1)=0;

  • N2

    If xy then N(x)N(y), x,yU.

And, a continuous FN is strict [25], when

  • N3a

    x>y then N(x)<N(y), x,yU.

Involutive FNs are called strong FN (shortly SFN):

  • N3

    N(N(x))=x, xU.

Definition 2.1

Let N be a FN and f:UnU be a real function. The N-dual function of f is given by the expression:

fN(x)=N(f(N(x))),x=(x1,,xn)Un, (1)

where N(x)=(N(x1),,N(xn))Un.

Notice that, when N is involutive, (fN)N=f, that is the N-dual function of fN coincides with f. In addition, if f=fN then it is clear that f is a self-dual function.

2.2. Triangular conorm

A function S:U2U is a triangular-conorm (t-conorm) if and only if it satisfies, for all x,y,zU, the following properties.

  • S1

    : S(x,0)=x (neutral element);

  • S2

    : S(x,y)=S(y,x) (commutativity);

  • S3

    : S(x,S(y,z))=S(S(x,y),z) (associativity);

  • S4

    : if xx, S(x,y)S(x,y) (monotonicity).

The notion of a triangular t-norm T:U2U can be analogously defined by properties from T2 to T4, with the property S1 replaced by T1: T(x,1)=x, for all x,y,zU.

Remark 2.1

Let N be a fuzzy negation on U. In the sense of Eq. (1), the N-dual function of a t-conorm S, i.e. SN, is a t-norm if and only if N is strong. Conversely, the N-dual function of a t-norm T, i.e. TN, is a t-conorm if and only if N is strong. In this case, the pairs (S,SN) and (TN,T) are called of N-mutual duals.

Example 2.1

Let be the SFN NS(x)=1x and kN+ related to pairs of NS-mutual dual aggregations:

SM(x,y)=max(x,y); TM(x,y)=min(x,y);
SP(x,y)=x + y − xy; TP(x,y)=xy;
SLK(x,y)=min(x+y,1); TLK(x,y)=max(x+y1,0);
SnM(x,y)={1,x+y1,max(x,y),otherwise; TnM(x,y)={0,x+y1,min(x,y),otherwise;
SYk(x,y)=min(xk+ykk,1); TYk(x,y)=max(1(1x)k+(1y)kk,0).

The following comparisons can be requested:

  • (i)

    By [26], the following holds: SMSPSLKSnM and SYmSYk when 0<km;

  • (ii)

    Since SS implies that SNSN for any t-conorm S and S and fuzzy negation N, we have that TnMTLKTPTM and TYkTYm when 0<km.

2.3. Fuzzy implication

A binary function I:U2U is a fuzzy implicator if I meets the minimal boundary conditions:

  • I0(a):

    I(1,1)=I(0,1)=I(0,0)=1I0(b): I(1,0)=0;

Definition 2.2

[22, Definition 1.15] An implicator I:U2U is a fuzzy implication if I also satisfies the conditions:

  • I1:

    If xz then I(x,y)I(z,y) (first place antitonicity);

  • I2:

    If yz then I(x,y)I(x,z) (second place isotonicity).

Let I(L(U)) be the family of fuzzy implication on L(U).

Several reasonable properties may be required for fuzzy implications. The properties considered in this paper are listed below and have been extensively studied, see more details in [7], [19], [39]:

  • I3:

    I(1,y)=y (left neutrality principle);

  • I4:

    I(x,1)=1 (dominance of truth of consequent);

  • I5:

    I(x,I(y,z))=I(y,I(x,z)) (exchange principle);

  • I6:

    I(x,y)=I(x,I(x,y)) (iterative boolean-like law);

  • I7:

    I(x,I(y,x))=1 (first axiom of Hilbert system);

  • I8:

    I(x,y)y (consequent boundary);

  • I8:

    NI(x)=I(x,0) is a SFN (natural-negation);

  • I9:

    I(x,y)=I(N(y),N(x)) (contrapositivity property w.r.t. a FN N and denoted by CP(N));

  • I9a:

    I(x,N(y))=I(y,N(x)) (right-contrapositivity w.r.t. a FN N and denoted by RCP(N));

  • I9b:

    I(N(x),y)=I(N(y),x) (left-contrapositivity w.r.t. a FN N and denoted by LCP(N));

  • I10:

    I(0,y)=1 (dominance of falsity);

  • I11:

    I(x,x)=1 (identity principle);

  • I12:

    I(x,y)=1 iff xy (ordering property);

  • I13:

    NI(x)=I(x,0) is a FN;

  • I13a:

    NI(x)=I(x,0) is a SFN;

  • I13b:

    NI(x)=I(x,0) is a continuous FN;

  • I13c:

    NI(x)=I(x,0) is a right invertible1 FN.

2.4. (S,N)-implication

An (S,N)-implication IS,N:U2U is defined by the expression:

IS,N(x,y)=S(N(x),y),x,yU, (2)

whenever S is a t-conorm and N is a fuzzy negation. This function is a fuzzy implication which generalizes the following classical logical equivalence: pq¬pq. When N is a strong fuzzy negation, then IS,N is a strong implication referred as S-implication. The name S-implication was firstly introduced in the fuzzy logic framework by [42].

Proposition 2.1

[7, Theorem 2.4.12] Let I:U2U be a function. I is an S-implication if and only if the properties I1, I5 and I13a are met.

3. n-Dimensional fuzzy sets

In [38], You-guang Shang et al. introduce a new extension of fuzzy sets, namely n-dimensional fuzzy sets in order to generalize in a natural way other two extensions: Interval-valued fuzzy sets [45], [37], [35] and 3-dimensional fuzzy sets [27]. In sequence, Benjamin Bedregal et al. proposed in [11] the following alternative definition for n-dimensional fuzzy sets:

Let X be a nonempty set, U=[0,1], nN{0} and Nn={1,2,,n}. An n-dimensional fuzzy set A over X is given by A={(x,μA1(x),,μAn(x)):xX}, when, for i=1,,n, the i-th membership degree of A denoted as μAi:XU verifies the condition μA1(x)μAn(x), for all xX.

In [10], for n1, n-dimensional upper simplex is given as

Ln(U)={x=(x1,,xn)Un:x1xn}, (3)

and its elements are called n-dimensional intervals. For each i=1,,n, the function πi:Ln(U)U defined by πi(x1,,xn)=xi is called of i-th projection of Ln(U).

An element xLn(U) is degenerated if

πi(x)=πj(x),i,jNn, (4)

so, a degenerate element (x,,x)Ln(U) will be denoted by /x/.

Remark 3.1

The natural order also called the product order on Ln(U) is defined for each x,yLn(U), as follows:

xyif and only ifπi(x)πi(y),iNn. (5)

In addition, (Ln(U),) is a distributive complete lattice [10]. Additionally, for each i=1,,n and for all x,yLn(u) the following partial order is also considered

xyx=y or πn(x)π1(y). (6)

Moreover, one can easily observe that ⪯ is more restrictive than ≤, meaning that xyxy.

According to Bedregal et al. in [11], Ln(U)=(Ln(U),,,/0/,/1/) is a distributive complete lattice with /0/ and /1/ being their bottom and top element, respectively, and ∨ and ∧ the supremum and infimum w.r.t. the product order. By [10], for all x,yLn(U), the supremum and infimum on Ln(U) are given as:

xy=(max(π1(x),π1(y)),,max(πn(x),πn(y))) (7)
xy=(min(π1(x),π1(y)),,min(πn(x),πn(y))). (8)

3.1. Automorphisms and conjugate functions on Ln(U)

According to [15] and [36], an n-dimensional automorphism on L(U) and their well-known results are both reported below:

Definition 3.1

A function φ:Ln(U)Ln(U) is an n-dimensional automorphism, (n-DA) if φ is bijective and the following condition is satisfied

xyφ(x)φ(y),x,yLn(U). (9)

The family of all automorphism on U and Ln(U) are denoted by Aut(U) and Aut(Ln(U)), respectively.

Proposition 3.1

[11, Theorem 3.4] Given a function φ:Ln(U)Ln(U) , φAut(Ln(U)) if and only if there exists ψAut(U) such that

φ(x)=(ψ(π1(x)),,ψ(πn(x))),xLn(U)

and, in this case, denote φ by ψ˜ .

Corollary 3.1

Each n-DA is continuous and strictly increasing.

Remark 3.2

According to [11, Proposition 3.4], given a ψAut(U), we have that ψ˜1=ψ1˜ and therefore ψ˜1Aut(Ln(U)), i.e. the inverse of n-dimensional automorphism always exists and it is also an n-dimensional automorphism.

Moreover, when φAut(Ln(U)) and F,Fφ:(Ln(U))kLn(U), the function Fφ is called the conjugate of F if for each x1,,xkLn(U) is verified that

Fφ(x1,,xk)=φ1(F(φ(x1),,φ(xk))). (10)

4. Fuzzy negations on Ln(U)

The notion of fuzzy negation on U was extended to Ln(U) in [11], as follows:

Definition 4.1

A function N:Ln(U)Ln(U) is an n-dimensional interval fuzzy negation (n-DN) if it satisfies the following properties:

  • N1:

    N(/0/)=/1/ and N(/1/)=/0/;

  • N2:

    If xy then N(x)N(y), for all x;yU.

Based on [31], an n-DN N is strict if it is a continuous function2 verifying the strict inequality:

  • N3(a):

    N(x)<N(y) when y<x.

Additionally, N is a strong n-DN if N verifies the involutive property:

  • N3:

    N(N(x))=x.

In [13, Prop. 3.8] was proved that each strong n-DN is also strict.

Example 4.1

The following unary functions on Ln(U) are examples of n-DN.

  • 1.

    NS(x)=(1πn(x),,1π1(x));

  • 2.

    NR(x)=(1πn(x)2,,1π1(x)2);

  • 3.

    NSR(x)=(1πn(x),,1πn2+1(x),1πn2(x)2,,1π1(x)2);

  • 4.

    NS2(x)=(1πn(x)2,,1π1(x)2);

  • 5.

    N(x)={/1/ if x=/0/,/0/ otherwise.

Notice that NS and NR are strong n-DN whereas NSR and NS2 are strict n-DN. Moreover, N is a non-continuous n-DN.

Remark 4.1

Let N1,N2:Ln(U)Ln(U). If N1N2=IdLn(U) then, in this case, we called N1 as a left inverse of N2 and N2 as a right inverse of N1.

In addition, one can observe that not all n-DN has a right or left inverse, e.g. N. In addition, a (left) right inverse of an n-DN N, if there exists one, it can not be an n-DN. Indeed, consider the n-DN N1:Ln(U)Ln(U) given as follows:

N1(x)={(0.9πn(x)0.8,,0.9π1(x)0.8) if /0.1/x/0.9//0/ if x/0.9//1/ otherwise.

The function N1 is the right inverse of the function N2(x)=NS(/0.8/x+/0.1/), which is not an n-DN because N2(/0/)=/0.9/.

So, the results from Remark 4.1 motivate us to the following definition of a (left) right invertible operator:

Definition 4.2

An n-DN N is (left) right invertible if there exists a (left) right inverse N which also is an n-DN.

Proposition 4.1

[11, Proposition 3.1] If N1,,Nn are fuzzy negations such that N1Nn . Then N1Nn˜:Ln(U)Ln(U) given by

N1Nn˜(x)=(N1(πn(x)),,Nn(π1(x))) (11)

is a representable n-DN and (N1,,Nn) their representants.

Proposition 4.2

[15, Proposition 3.3] Let N be an n-DN. The function N(i):UU is a fuzzy negation given by

N(i)(x)=πi(N(/x/)),i=1,,n. (12)

Remark 4.2

In particular, if N is a representable n-DN then (N(1),,N(n)) are their representants [15]. Observe that a representable n-DN N is strict if and only if their representants are strict fuzzy negations [31, Propositions 4.2 and 4.3].

Proposition 4.3

Let N be a representable n-DN. Then N is right invertible if and only if N(i) is right invertible for each iN .

Proof

(⇒) Suppose that Nr be the n-DN which is the right inverse of N. By Proposition 4.2, (Nr)(ni+1), is a fuzzy negation for each iNn. In addition, for each x[0,1],

N(i)((Nr)(ni+1)(x))=N(i)(π(ni+1)(Nr(/x/)/)) by (12)=πi(N(Nr(/x/))) by Remark 4.2 and (11)=πi(/x/)=x.

Therefore, N(i) is right invertible for each iNn.

(⇐) By Remark 4.2, N=N(1),,N(n)˜. So, let Nir be the right inverse of N(i) for each iNn. First observe that, if ij then NirNjr. So, by (11), the following holds: N(NnrN1r˜(x))=N(Nnr(πn(x)),,N1r(π1(x)))=(N(1)(N1r(π1(x))),,N(n)(Nnr(πn(x))))=x, for each xLn(U). □

Remark 4.3

From the proof of Proposition 4.3 we have that if N is right invertible and representable then their right inverse Nr also is representable and (Nr)(ni+1) is the right inverse of N(i) for each iN.

Proposition 4.4

If N is a strict n-DN then, there exists a strict n-DN N1 such that NN1=N1N=IdLn(U) . In addition, if N is a representable n-DN then N1 is also a representable n-DN in Ln(U) .

Proof

Since N is a strict and representable n-DN, then by Remark 4.2, N(x)=(N(1),,N(n))(x) and for each iNn, N(i) is a strict fuzzy negation and therefore has an inverse N(i)1. Trivially, if 1ijn then N(i)1N(j)1. So, by Proposition 4.1 and Remark 4.2, N(1)1N(n)1˜ is a strict representable n-DN. Then, we obtain that

NN(1)1N(n)1˜(x)=N(1)N(n)˜(N(1)1N(n)1˜(x))=N(1)N(n)˜(N(1)1(πn(x)),,N(n)1(π1(x)))=(N(1)N(1)1(π1(x)),,(N(n)N(n)1(πn(x))=(π1(x),,πn(x))=x.

Therefore, NN(1)1N(n)1˜=Id(Ln(U)) which means that N1=N(1)1N(n)1˜. Hence, N1 is a strict representable n-DN. □

The family of all n-DN will be denoted by N(Ln(U)). Let N be fuzzy negations and NN˜ will be denoted just as N˜.

Theorem 4.1

[15, Theorem 3.3] A function N:Ln(U)Ln(U) is a strong n-DN if and only if there exists a strong fuzzy negation N such that N=N˜ .

Thus, for the strong n-DN in the Example 4.1, we have that NS=NS˜ where NS is the standard fuzzy negation NS(x)=1x and NS2=NS2˜ where NS2(x)=1x2.

Proposition 4.5

[15, Proposition 4.2] Let φAut(Ln(U)) . N is (strict, strong) n-DN if and only if Nφ is an (strict, strong) n-DN.

Proposition 4.6

[15, Proposition 4.3, Theorem 4.2] A function N:Ln(U)Ln(U) is a strong n-DN if and only if there exists an automorphism ψ such that N=NSψ˜=NS˜ψ˜ .

5. Triangular conorms on Ln(U)

In [11], the notion of aggregation function was extended for n-dimensional intervals, as follows:

Definition 5.1

[11] Let m and n be positive natural numbers such that m2. A function P:(Ln(U))mLn(U) is an n-dimensional m-ary aggregation function, if P(/0/,,/0/)=/0/, P(/1/,,/1/)=/1/ and for each x1,,xm,y1,,ymLn(U) such that xiyi for all iNm we have that P(x1,,xm)P(y1,,ym).

Based on the relevance of the t-norm and t-conorm classes as bivariate aggregation operators, their extension on Ln(U) were presented in [32]. Thus, their main concepts and results are reported as follows:

Definition 5.2

A function S:Ln(U)2Ln(U) is an n-dimensional t-conorm (n-DS) if it verifies, for all x,y,zLn(U), the following properties:

  • S1:

    S(x,/0/)=x (neutral element);

  • S2:

    S(x,y)=S(y,x) (commutativity);

  • S3:

    S(x,S(y,z))=S(S(x,y),z) (associativity);

  • S4:

    if xx, S(x,y)S(x,y) (monotonicity related to the product order in Eq. (5)).

Let S be an n-DS and N an n-DN. A pair (S,N) satisfies the law of excluded middle (LEM) if

  • S5:

    S(N(x),x)=/1/,xLn(U).

Analogously, an n-dimensional t-norm (n-DT) T:Ln(U)2Ln(U) has /1/ as the neutral element, is commutative, associative and a monotonic function with respect to the product order.

According to [11], the conditions under which an n-DS can be obtained from a finite subset of t-conorm Si:U2U, for iNn1, are reported below.

Proposition 5.1

[32, Theorem 2.1] Let Ti,Si:U2U be t-norms and t-conorms with iNn . If TiTi+1 and SiSi+1 for each iNn1 then the functions T1Tn˜,S1Sn˜:Ln(U)2Ln(U) defined by

T1Tn˜(x,y)=(T1(π1(x),π1(y)),,Tn(πn(x),πn(y))) (13)

and

S1Sn˜(x,y)=(S1(π1(x),π1(y)),,Sn(πn(x),πn(y))) (14)

are, respectively, an n-DT and n-DS called as representable operators.

Proposition 5.2

Let S be n-DS and N be a strong n-DN. Then, SN:Ln(U)2Ln(U) defined as

SN(x,y)=N(S(N(x),N(y)))

is n-DT. In addition if S is representable then SN also is.

Proof

Trivially, SN is commutative and has /1/ as neutral element. If yz then N(z)N(y) and therefore, S(N(x),N(z))S(N(x),N(y)). Hence, SN(x,y)=N(S(N(x),N(y)))N(S(N(x),N(z)))=SN(x,z) and therefore SN is increasing. Finally, SN(x,SN(y,z))=N(S(N(x),N(N(S(N(y),N(z)))))=N(S(N(x),S(N(y),N(z)))=N(S(S(N(x),N(y)),N(z)))=SN(SN(x,y),z)). So, SN is associative and therefore is n-DT.

In addition, since N is a strong n-DN by Theorem 4.1, there exists a strong fuzzy negation N such that N=N˜. So, if S is representable, i.e. S=S1Sn˜ for some t-conorms S1Sn. Then,

SN(x,y)=N(S(N(x),N(y)))=(N(S1(N(π1(x)),N(π1(y)))),,N(Sn(N(πn(x)),N(πn(y))))=((S1)N(π1(x),π1(y)),,(Sn)N(πn(x),π1(y)))=(S1)N(Sn)N˜(x,y)

So, by Remark 2.1 and Proposition 5.1, SN is a representable n-DT. □

Let S be a t-conorm and T be a t-norm. We will denote SS˜ and TT˜ just as S˜ and T˜, respectively.

Example 5.1

Applying the results from Proposition 5.1, some examples are presented below:

  • (i)

    Based on Example 2.1, the following operators SM,SP,SLK,SnM˜ and its corresponding NS-dual construction TnM,TLK,TPTM˜ are representable 4-DS and 4-DT as on L4(U);

  • (ii)

    Analogously, SM,SP,SLK˜ and its corresponding NS-dual construction TLK,TP,TM˜ are representable 3-DS and 3-DT as on L3(U);

  • (iii)

    SM˜, SP˜, SLK˜ and SnM˜ are representable n-DS Ln(U);

  • (iv)

    TM˜, TP˜, TLK˜ and TnM˜ are representable n-DT Ln(U);

  • (v)

    For any nN+, SYn+1,,SY2˜ are other representable n-DS on Ln(U).

Proposition 5.3

Each representable n-DS S has an unique representation.

Proof

Suppose that S=S1Sn˜ and S=S1Sn˜. Then, from Eq. (14), for each x,yU, Si(x,y)=πi(S(/x/,/y/))=Si(x,y). □

Proposition 5.4

Let S be a representable n-DS. Then, for iNn , the function S(i):U2U given by

S(i)(x,y)=πi(S(/x/,/y/))

is a t conorm.

Proof

Since S is a representable n-DS then there exist t-conorms S1,,Sn such that S=S1Sn˜. The proposition follows, once clearly S(i)=Si for each iNn. In fact, for each x,yU, S(i)(x,y)=πi(S(/x/,/y/))=Si(x,y). Therefore, Proposition 5.4 is verified. □

Corollary 5.1

Let S be a representable n-DS then S=S(1)S(n)˜ .

Proof

Straightforward from Proposition 5.3, Proposition 5.4. □

The next proposition extends results from [46, Proposition 4].

Proposition 5.5

[11, Theorem 3.6] Let S be an n-DS and φ be an n-DA. Then Sφ is also an n-DS.

Proposition 5.6

Let S be a representable n-DS and ψAut(U) . Then for each iNn , (S(i))ψ=(Sψ˜)(i) .

Proof

Let iNn and x,yU. Then

(Sψ˜)(i)(x,y)=πi(Sψ˜(/x/,/y/))=πi(ψ˜1(S(ψ˜(/x/),ψ˜(/y/))))=πi(ψ1˜(S(/ψ(x)/),/ψ(y)/))=ψ1(πi(S(/ψ(x)/),/ψ(y)/))=ψ1(S(i)(ψ(x),ψ(y)))=(S(i))ψ(x,y)

Then, Proposition 5.6 is verified. □

Since, each n-dimensional t-norm T and t-conorm S are associative operators, then for each natural number m2, they can be naturally extended for an m-ary n-dimensional aggregation function, as follows:

T[m](x1,,xm)={T(x1,x2), if m=2,T(T[m1](x1,,xm1),xm) otherwise;and (15)
S[m](x1,,xm)={S(x1,x2), if m=2,S(S[m1](x1,,xm1),xm) otherwise; (16)

respectively.

6. Fuzzy implications on Ln(U)

This section studies n-dimensional fuzzy implications on the lattice (Ln(U),) introduced in [46] extending this work investigating construction methods of n-dimensional fuzzy implications from fuzzy implications preserving their main properties. Additionally, if n=2, the n-dimensional fuzzy implications are the usual interval-valued fuzzy implications as investigated in [1], [9], [16] and therefore, their corresponding properties are investigated in the more general n-dimensional interval space.

Definition 6.1

A function I:Ln(U)2Ln(U) is an n-dimensional fuzzy implicator if I meets the following minimal boundary conditions:

  • I0(a):

    I(/1/,/1/)=I(/0/,/1/)=I(/0/,/0/)=/1/;

  • I0(b):

    I(/1/,/0/)=/0/.

Definition 6.2

An n-dimensional fuzzy implicator I is an n-dimensional fuzzy implication (n-DI), if it also satisfies the properties:

  • I1:

    xzI(x,y)I(z,y) (first-place antitonicity);

  • I2:

    yzI(x,y)I(x,z) (right-place isotonicity).

We also consider the following extra properties for n-DIs:

  • I3:

    I(/1/,y)=y (left neutrality property);

  • I4:

    I(x,/1/)=/1/ (right boundary condition);

  • I5:

    I(x,I(y,z))=I(y,I(x,z)) (exchange principle);

  • I6:

    I(x,y)=I(x,I(x,y)) (iterative Boolean law);

  • I7:

    I(x,I(y,x))=/1/ (first axiom of Hilbert system);

  • I8:

    I(x,y)y (right boundary condition);

  • I9:

    I(x,y)=I(N(y),N(x)) (contraposition property w.r.t. an n-DN N and denoted by CP(N).

And, two other conditions are required in I9, meaning that

  • I9(a):

    I(x,N(y))=I(y,N(x)) (right-contraposition property w.r.t. an n-DN N and denoted by RCP(N));

  • I9(b):

    I(N(x),y)=I(N(y),x) (left-contraposition property w.r.t. an n-DN N and denoted by LCP(N));

  • I10:

    I(/0/,y)=/1/ (left boundary condition);

  • I11:

    I(x,x)=/1/ (identity principle).

  • I12:

    xyI(x,y)=/1/ (ordering principle);

  • I13:

    NI(x)=I(x,/0/) is an n-DN.

Moreover, additional conditions are required in I13, meaning that new properties related to natural negations can be discussed as follows:

  • I13(a):

    NI(x)=I(x,/0/) is a strong n-DN;

  • I13(b):

    NI(x)=I(x,/0/) is a continuous n-DN;

  • I13(c):

    NI(x)=I(x,/0/) is a right invertible n-DN.

Proposition 6.1

Each n-dimensional fuzzy implication satisfies I4 , I10 , and I13 .

Proof

Let x,yLn(U). Then

I4: By I1, /1/=I(/0/,/1/)I(x,/1/);

I10: By I2, /1/=I(/0/,/0/)I(/0/,x);

I13: NI(/0/)=I(/0/,/0/)=/1/;   and   NI(/1/)=I(/1/,/0/)=/0/;

If xy then, by I1, NI(y)=I(y,/0/)I(x,/0/)=NI(x). Therefore, Proposition 6.1 is verified. □

Lemma 6.1

Let I:Ln(U)2Ln(U) be a n-DI and Let N:Ln(U)Ln(U) be a strong n-DN. The following statements are equivalent:

  • (i)

    I verify CP(N) ;

  • (ii)

    I verify LCP(N) ;

  • (iii)

    I verify RCP(N) .

Proof

Straightforward. □

Proposition 6.2

Let I:Ln(U)2Ln(U) be a n-dimensional fuzzy implicator which satisfies I13(a) .

  • (i)

    If I verifies CP(NI) , then I verifies I3 .

  • (ii)

    If I verifies I5 , then verifies I0 (a), I0 (b), I3 , CP(NI) , RCP(NI) and LCP(NI) .

Proof

Since I satisfies I13(a), then NI is a strong n-DN and therefore satisfies N3. Then,

  • (i)
    for each yLn(U), definition of NI, we have that:
    y=NI(NI(y))=I(NI(y),NI(/1/))=I(/1/,y) by N3 , N1 and CP(NI), respectively.
  • (ii)
    By definition of NI we have that
    I0(a):I(/0/,/0/)=NI(/0/)=/1/ and I0(c):I(/1/,/0/)=NI(/1/)=/0/RCP(NI):I(x,NI(y))=I(x,I(y,/0/))=I(y,I(x,/0/))=I(y,NI(x)) by I5 and I13.
    So, by Lemma 6.1, I also satisfies CP(NI) and LCP(NI). Then, by above (a) and (b) items, I satisfies I3. Finally, from CP(NI), I0(b):I(/1/,/1/)=I(NI(/0/),NI(/0/))=I(/0/,/0/)=/1/.

Concluding, Proposition 6.2 is verified. □

Proposition 6.3

Let I:Ln(U)2Ln(U) be an n-DI such that properties I5 and I13(c) are verified. Then I verifies LCP(NIr) where NIr is the right inverse of NI .

Proof

Let x,yLn(U). Then by I5, I(NIr(x),y)=I(NIr(x),NI(NIr(y)))=I(NIr(y),NI(NIr(x)))=I(NIr(y),x). Therefore, Proposition 6.3 is verified. □

Proposition 6.4

If an n-DI I satisfies I5 and I12 then for each xLn(U) we have that

  • 1.

    xNI(NI(x)) ;

  • 2.

    NI(NI(NI(x)))NI(x) .

Proof

Let xLn(U), the following holds:

I(x,NI(NI(x)))=I(x,I(I(x,/0/),/0/))=I(I(x,/0/),I(x,/0/)) by I5=I(NI(x),NI(x))=/1/ by I12.

So, I(x,NI(NI(x)))=/1/ and then, by I12, xNI(NI(x)). In addition, since NI is decreasing, it implies that NI(NI(NI(x)))NI(x) for each xLn(U). Therefore, Proposition 6.4 is verified. □

6.1. Representable n-DI on Ln(U)

Proposition 6.5

[46, Prop. 6] Let I1,,In:U2U be functions such that I1In . Then, for all x , yLn(U) , the function I1In˜:Ln(U)2Ln(U) given by

I1In˜(x,y)=(I1(πn(x),π1(y)),,In(π1(x),πn(y))), (17)

is an n-DI (n-dimensional fuzzy implicator) if and only if I1,,In are also fuzzy implications (implicators).

Based on Proposition 6.5, I is called representable n-DI (n-dimensional fuzzy implicator) if there exist fuzzy implications (implicators) I1In such that I=I1In˜. In addition, the n-tuple of implications (I1,,In) is called a representant of I. Moreover, when I1==In=I, expression I1In˜ in (17) is denoted by I˜.

Remark 6.1

Let I(Ln(U)) be the set of all n-DI. For all x, yLn(U) when I1In˜,I˜I(Ln(U)), we have that

  • (i)

    πi(I1In˜(x,y))=Ii(πn+1i(x),yi), for i=1,,n;

  • (ii)

    πi(I1In˜(/x/,/y/))=Ii(x,y);

  • (iii)

    πi(I˜(/x/,/y/))=I(x,y).

The next proposition shows that a conjugate operation w.r.t. an n-DI also is an n-DI.

Proposition 6.6

Let I be an n-DI and φAut(Ln(U)) . Then Iφ also is an n-DI.

Proof

Trivial, once φ(/0/)=/0/=φ1(/0/), φ(/1/)=/1/=φ1(/1/) and both, φ and φ1, are increasing functions. □

Lemma 6.2

Let I be an n-DI (n-dimensional fuzzy implicator) and iNn . Then the function I(i):[0,1]2[0,1] defined by

I(i)=πi(I(/x/,/y/)

is a fuzzy implication (implicator).

Proof

We have that I(i)(0,x)=πi(I(/0/,/x/))=π(/1/)=1, I(i)(x,1)=πi(I(/x/,/1/))=π(/1/)=1 and I(i)(1,0)=πi(I(/1/,/0/))=π(/0/)=0. So, I(i) satisfies the boundary conditions of fuzzy implications, i.e. it is a fuzzy implicator when I is an n-dimensional fuzzy implicator. Now, if xz then /x//z/ and therefore by I1, it holds that I(i)(x,y)=πi(I(/x/,/y/))πi(I(/z/,/y/))=I(i)(z,y). Analogously, it is possible to prove that I(i)(x,y)I(i)(x,z) whenever yz. And, Lemma 6.2 holds. □

Proposition 6.7

Let I be an n-DI (n-dimensional fuzzy implicator), ψAut(U) and φ=ψ˜Aut(Ln(U)) . Then the following statements are equivalent:

  • 1.

    I is representable;

  • 2.

    I=I(1),,I(n)˜ ;

  • 3.

    (Iφ)(i)=(I(i))ψ for each iNn and Iφ is a representable n-DI (n-dimensional fuzzy implicator).

Proof

(12) If I is representable then there exists fuzzy implications Ii, with i=1,,n, such that IiIi+1 and I=I1In˜. Let x,yU then I(i)(x,y)=πi(I(/x/,/y/))=πi(I1In˜(/x/,/y/))=Ii(x,y). Therefore, I=I(1),,I(n)˜.

(23) Since, by Proposition 6.6, Iφ is an n-DI then, by Lemma 6.2, (Iφ)(i) for each iNn is a fuzzy implication (implicator) and φ1=ψ˜1=ψ1˜ then

(Iφ)(i)(x,y)=πi(φ1(I(φ(/x/),φ(/y/))))=πi(ψ1˜(I(/ψ(x)/,/ψ(y)/)))=ψ1(πi(I(/ψ(x)/,/ψ(y)/)))=ψ1(I(i)(ψ(x),ψ(y))))=(I(i))ψ(x,y).

On the other hand, for each x,yLn(U), it holds that

Iφ(x,y)=φ1(I(φ(x),φ(y)))=ψ1˜(I(1)I(n)˜(ψ˜(x),ψ˜(y)))=ψ1˜(I(1)(πn(ψ˜(x),π1(ψ˜(y)))),,I(n)(π1(ψ˜(x),πn(ψ˜(y)))))=ψ1˜(I(1)(ψ(πn(x),ψ(π1(y)))),,I(n)(ψ(π1(x),ψ(πn(y)))))=((I(1))ψ(πn(x),π1(y)),,(I(n))ψ(π1(x),πn(y))=(I(1))ψ(I(n))ψ˜(x,y)=(Iφ)(1)(Iφ)(n))˜(x,y).

Therefore, Iφ is representable.

(31) Since φ1Aut(Ln(U)), then I=(Iφ)φ1 and therefore, since Iφ is representable, then there exist fuzzy implications (implicators) I1In such that Iφ=I1In˜ and by 3.1 there exists an automorphism ψ such that φ=ψ˜. So, for each x,yLn(U) we have that

I(x,y)=(Iφ)φ1(x,y)=φ(Iφ(φ1(x),φ1(y)))=ψ˜(I1In˜(ψ˜1(x),ψ˜1(y)))=ψ˜(I1In˜(ψ1˜(x),ψ1˜(y))) by Remark 3.2=(I1ψ(πn(x),π1(y)),,Inψ(π1(x),πn(y)))

and since each Iiψ is a fuzzy implication (implicator) and I1ψInψ then I is representable. □

Corollary 6.1

Each representable n-DI has exactly a unique representant n-tuple of fuzzy implications.

Corollary 6.2

For all representable n-DI I we have that NI(1)NI(n) .

Proof

From Proposition 6.7, we have that I(1)I(n). So, for each x[0,1] we have that I(1)(x,0)I(n)(x,0) or equivalently that NI(1)(x)NI(n)(x). □

6.2. Continuity of n-dimensional fuzzy implications

The condition under which an n-dimensional interval fuzzy implication verifies the continuity on I(Ln(U)) based on the continuity of family I(Un) of fuzzy implications on Un is considered in the following.

Definition 6.3

Let ϕ:UnLn(U) be the (Un,Ln(U))-permutation expressed by the increase ordering, meaning that ϕ(x1,,xn)=(x(1),,x(n)) such that {(1),,(n)}={1,,n} and x(i)x(i+1),i=1,,n1. A function F:Ln(U)2Ln(U) is continuous if the related function Fϕ:Un×UnUn given by

Fϕ(x,y)=F(ϕ(x),ϕ(y)) (18)

is continuous in the usual sense.

Observe that, since Ln(U)Un, then Fϕ is well defined.

Proposition 6.8

Let I be a representable n-DI. Then I is continuous if and only if I(i) is continuous for each i=1,,n .

Proof

(⇒) Let ϕ:UnLn(U) be the (Un,Ln(U))-permutation and δ:UnUn the function δ(x1,,xn)=(xn,,x1). Since, I1In˜ϕ is continuous and I1In˜ϕ=(I1××In)((δϕ)×ϕ) then each Ii is continuous. So, from Proposition 5.6, I(i) is continuous for each iNn.

(⇐) If I(i) is continuous for each iNn, then I(1)××I(n) also is continuous. Therefore, since I(1)I(n)˜ϕ=(I(1)××I(n))((δϕ)×ϕ) and δ as well as ψ are continuous, I1(1)I(n)˜ϕ is continuous. Hence, by Definition 6.3, I(1)I(n)˜ is continuous. □

6.3. Other main properties of n-dimensional fuzzy implications

In the following, main properties of fuzzy implications on L(U) are preserved by the representable n-dimensional fuzzy implications on Ln(U).

Proposition 6.9

[46, Propositions 6 and 11] A representable n-DI I verifies the property Ik , for k=1,,6,8,10 if and only if each I(i) , with iNn , verifies the corresponding property Ik .

Proposition 6.10

No representable n-DI satisfies I7 .

Proof

Let I be a representable n-DI and x=(0,1,,1(n1)times) we have that

I(x,I(/1/,x))=I(x,(I(1)(1,0),I(2)(1,1),,I(n)(1,1))=I(x,x)=x/1/.

Therefore, Proposition 6.10 is verified. □

Proposition 6.11

Let N be a representable n-DN and I a representable n-DI. The pair (N,I) verifies I9 ( I9(a) , I9(b) ) and N(1)==N(n)=N ) if and only if for each i=1,,n ,

  • 1.

    the pair (N(i),I(i)) verifies corresponding property I9(a) ;

  • 2.

    the pair (N(ni+1),I(i)) verifies corresponding property I9(b) ;

  • 3.

    N(1)==N(n)=N and the pair (N,I(i)) verifies corresponding property I9

respectively.

Proof

By Remark 4.2 and Proposition 6.7 we have that N=N(1)N(n)˜ and I=I(1)I(n)˜.

(⇐) Since the pair (N(i),I(i)) verifies I9(a) for each i=1,,n, then the following holds:

I9(a):I(x,N(y))=(I(1)(πn(x),N(1)(πn(y))),,I(n)(π1(x),N(n)(π1(y)))) by (11) and (17)=(I(1)(πn(y),N(1)(πn(x))),,I(n)(π1(y),N(n)(π1(x)))) by I9(a)=I(y,N(x)) by (17) and (11).

Since, the pair (N(ni+1),I(i)) verifies I9(b), for each i=1,,n, then we have that:

I9(b):I(N(y),x)=(I(1)(N(n)(π1(y)),π1(x)),,I(n)(N(1)(πn(y)),πn(x))) by (11) and (17)=(I(1)(N(n)(π1(x)),π1(y)),,I(n)(N(1)(πn(x)),πn(y))) by I9(b)=I(N(x),y) by (11) and (17).

In addition, since the pair (N,I(i)) verifies I9, for each i=1,,n, it holds that:

I9:I(N˜(y),N˜(x))=(I(1)(N(π1(y)),N(πn(x))),,I(n)(N(πn(y)),N(π1(x)))) by (11) and (17)=(I(1)(πn(x),π1(y)),,I(n)(π1(x),πn(y))) by I9=I(x,y) by (17).

() Conversely, since (N,I) verifies I9(a), (I9(b), I9), we have the following results:

I9(a):I(i)(y,N(i)(x))=πi(I(1)(y,N(1)(x)),,I(n)(y,N(n)(x)))=πi(I(/y/,N(/x/))) by (17) and (11)=πi(I(/x/,N(/y/))) by I9=πi(I(1)(x,N(1)(y)),,I(n)(x,N(n)(y)))I(i)(y,N(i)(x)) by (11) and (17) .
I9(b):I(i)(N(ni+1)(x),y)=πi(I(1)(N(n)(x),y),,I(n)(N(1)(x),y))=πi(I((N(1)(x),,N(n)(x)),/y/))) by (17) =πi(I(N(/x/),/y/)) by (11)=πi(I(N(/y/),/x/)) by I9(b)=πi(I(1)(N(n)(y),x),I(n)(N(1)(y),x))=I(i)(N(ni+1)(y),x) by (11) and (17) .
I9:I(i)(N(y),N(x))=πi(I(1)(N(y),N(x)),,I(n)(N(y),N(x)))=πi(I(N˜(/y/),N˜(/x/)))by (17) and (11)=πi(I(/x/,/y/))=I(i)(x,y) by I9 and (17).

Therefore, Proposition 6.11 is verified. □

Proposition 6.12

No representable n-DI satisfies I11 .

Proof

Let I be a representable n-DI. If n2 taking x=(0,,0(n1)times,1) we have that

I(x,x)=(I(1)(1,0),I(2)(0,0),,I(n1)(0,0),I(n)(0,1))=(0,1,,1(n1)times)/1/. □

Corollary 6.3

No representable n-DI satisfies I12 .

Proof

Straightforward. □

Lemma 6.3

Let I be a representable n-DI. Then NI is a representable n-DN and (NI)(i)=NI(i) , iNn .

Proof

By Proposition 6.1 we have that NI is an n-DN. So, in Proposition 4.2 and for each iNn, (NI)(i) is a fuzzy negation and, by Remark 4.2, they are the representant of NI. In addition, (NI)(i)(x)=πi(NI(/x/))=πi(I(/x/,/0/))=I(i)(x,0)=NI(i)(x) for each xU. And, Lemma 6.3 holds. □

From Proposition 6.1, each n-DI I satisfies I13 and NI is a representable n-DN.

Proposition 6.13

Let I be a representable n-dimensional fuzzy implication. If I satisfies I13(a) ( I13(b) , I13(c) ) then for each iNn , I(i) satisfies I13(a) ( I13(b) , I13(c) ).

Proof

By Proposition 6.1 and Lemma 6.3 we have that NI is a representable n-DN and (NI)(i)=NI(i) for each iNn. In addition, the following holds:

(I13(a)I13(a)) Since I satisfies I13(a) then by Lemma 6.3 and Theorem 4.1, (NI)(i)=(NI)(j) (or equivalently NI(i)=NI(j)) for each i,jNn. Hence, NI=NI(1)˜ and therefore for each xU and iNn we have that /πi(NI(/x/))/=NI(/x/). Consequently, NI(i)(NI(i)(x))=πi(NI(/πi(NI(/x/))/))=πi(NI(NI(/x/)))=πi(/x/)=x.

(I13(b)I13(b)) Since NI is a continuous n-DN then (NI)(i) is a continuous function, for each iNn. By Proposition 6.1 and Lemma 6.3, NI(i) is a continuous fuzzy negation. Consequently, I(i) satisfies I13(b).

(I13(c)I13(c)) By Proposition 6.1 and Lemma 6.3 we have that NI is a representable n-DN. From Corollary 6.2, NI(i)NI(j) or equivalently, (NI)(i)(NI)(j), whenever ij. Since I satisfies I13(c) then NI is right invertible, and therefore by Proposition 4.3, each NI(i) is also right invertible. Concluding the proof, the Corollary 6.13 holds. □

Remark 6.2

Observe that the converse construction of Proposition 6.13 does not always hold. In fact, let I=ILK1ILKn˜ be an n-DI where

ILKi(x,y)=min(1,1xi+yim),iNn.

It is an example of representable n-DI which neither satisfies I13(a) nor satisfies I13(c). However, each ILKi satisfies I13(a) and therefore I13(c), since NILKi(x)=1xii is a strong fuzzy negation. Finally, one can also easily verify that the converse of the other item holds, meaning that I13(b)I13(b).

7. (S,N)-Implications on Ln(U)

Properties in the class of (S,N)-Implication on Ln(U) are analyzed in the following propositions.

7.1. Definition of n-dimensional (S,N)-implication

Proposition 7.1

Let S be a n-DS and N be a n-DN. The function IS,N:Ln(U)2Ln(U) given by

IS,N(x,y)=S(N(x),y) (19)

is an n-dimensional fuzzy implication called as n-dimensional (S,N) -implication.

Proof

Let S be an n-DITS and N be an n-DIFN. The following holds:

  • I0:

    The boundary conditions I0(a) and I0(b) are verified:

    IS,N(/1/,/1/)=S(/0/,/1/)=/1/;   IS,N(/0/,/1/)=S(/1/,/0/)=/1/;

    IS,N(/0/,/0/)=S(/1/,/0/)=/1/;   IS,N(/1/,/0/)=S(/0/,/0/)=/0/;

  • I1:

    xzIS,N(x,y)=S(N(x),y)S(N(z),y)=I(z,y), based on both properties, the monotonicity of S and the monotonicity of N;

  • I2:

    Analogously, yzI(x,y)=S(N(x),y)S(N(x),z)=I(x,z), based on the monotonicity of S.

Therefore, IS,N satisfies the conditions of Definition 6.2 and Proposition 7.1 is verified. □

Remark 7.1

The underlying n-DS and n-DN of an n-dimensional (S,N)-implication I are called the pair of generators. Let N be a strong n-DN. IS,N is denoted by IS and it is called as S-implication.

7.2. Characterizing n-dimensional (S,N)-implication

Proposition 7.2

Let I be an n-dimensional (S,N) -implication and (S,N) be the generator pair of I . Then, the following properties hold:

  • (i)

    I verifies I3 and I5 ;

  • (ii)

    NI=N ;

  • (iii)

    I verifies RCP(N) ;

  • (iv)

    If N is right invertible with right inverse Nr then I verifies LCP(Nr) ;

  • (v)

    N is strong if and only if I verifies CP(N) .

Proof

For all x,y,z, the following holds:

  • (i)

    For each yŁn(U) we have that I(/1/,y)=S(/0/,y)=y and therefore IS,N verify I3. Since S verifies the S2 and S3 properties, the following holds for each x,yLn(U):

    S(N(x),S(N(y),z)))=S(S(N(x),N(y)),z)))=S(S(N(y),N(x)),z)))=S(N(y),S(N(x),z))).

    Therefore, I(x,I(y,z))=I(y,I(x,z)). So I verifies I5.

  • (ii)

    For each xŁn(U) we have that NI(x)=I(x,/0/)=S(N(x),/0/)=N(x).

  • (iii)

    Straightforward from the previous item and Proposition 6.2(ii).

  • (iv)

    For each x,yŁn(U) we have that I(Nr(x),y)=S(N(Nr(x)),y)=S(x,y)=S(y,x)=S(N(Nr(y)),x)=I(Nr(y),x).

  • (v)

    (⇒) Since, N is strong then for each x,yŁn(U) we have that I(N(x),N(y))=S(N(N(x)),N(y))=S(N(y),x)=I(y,x), i.e. I satisfies CP(N).

    (⇐) When xLn(U), then the following holds:
    N(N(x))=S(N(N(x)),N(/1/)) by N1 and S1=I(N(x),N(/1/)) by (19)=I(/1/,x) by CP(N)=x by item (i).

Therefore, Proposition 7.2 is verified. □

Proposition 7.3

Let I:Ln(U)2Ln(U) be an n-DI and N be a n-DN. If SI,N:(Ln(U))2Ln(U) is the given function as follows:

SI,N(x,y)=I(N(x),y),x,yLn(U).

Then the following holds:

  • (i)

    SI,N(/1/,x)=SI,N(x,/1/)=/1/ ;

  • (ii)

    If I verifies I3 then SI,N(/0/,x)=x ;

  • (iii)

    SI,N is increasing in both variables;

  • (iv)

    SI,N is commutative if and only if I satisfies LCP(N) ;

  • (v)

    if I verifies I5 and LCP(N) then SI,N is associative.

Proof

By Proposition 6.1, I satisfies I4 and I10. So, for x,y,z(Ln(U)), we obtain the following results:

(i)SI,N(x,/1/)=I(N(x),/1/)=/1/ by I4;SI,N(/1/,x)=I(N(/1/),x)=/1/ by I10.(ii)SI,N(/0/,x)=I(N(/0/),x)=x by I3.(iii) if x1x2 then SI,N(x1,y)=I(N(x1),y)I(N(x2),y)=SI,N(x2,y); if y1y2 then SI,N(x,y1)=I(N(x),y1)I(N(x),y2)=SI,N(x,y2).(iv)()SI,N(x,y)=I(N(x),y)=I(N(y),x)=SI,N(y,x) by LCP(N);()I(N(x),y)=SI,N(x,y)=SI,N(y,x)=I(N(y),x) by S2;(v)SI,N(SI,N(x,y),z)=I(N(I(N(x),y)),z)=I(N(z),I(N(x),y))=I(N(x),I(N(z),y))=SI,N(x,SI,N(z,y))=SI,N(x,SI,N(y,z)) by I5, LCP(N) and (iv).

Therefore, Proposition 7.3 is verified. □

Corollary 7.1

Let I:Ln(U)2Ln(U) be an n-dimensional (S,N) -implication. If I satisfies I13(c) then SI,N is an n-DS.

Proof

Straightforward from Proposition 6.3, Proposition 7.2, Proposition 7.3. □

Proposition 7.4

Let I:Ln(U)2Ln(U) be an n-dimensional (S,N) -implication such that NI is right invertible n-DN. Then (SI,NIr,NI) is the generator pair of I whenever NIr is a right inverse of NI .

Proof

Since I is an n-dimensional (S,N)-implication then there exists an n-DS S and n-DN N such that I=IS,N. By Proposition 7.2(ii), N=NI and once NI is right invertible then there is an n-DN NIr such that NINIr=IdLn(U). So, SI,NIr(x,y)=I(NIr(x),y)=S(N(NIr(x)),y)=S(NI(NIr(x)),y)=S(x,y) and therefore SI,NIr=S. Hence, (SI,NIr,NI)=(S,N), i.e. is a generator pair of I. □

Theorem 7.1

Let I:Ln(U)2Ln(U) be an n-DI such that NI is right invertible. Then the following statements are equivalent:

  • (i)

    I is an n-dimensional (S,N) -implication;

  • (ii)

    I satisfies I3 and I5 .

Proof

(i)(ii): By Proposition 7.4, I=ISI,NIr,NI and then, by Proposition 7.2(i), I satisfies I3 and I5.

(ii)(i): Since I satisfies I3, I5 and I13(c) then by Proposition 6.3, I also satisfies LCP(NIr), where NIr is the right inverse of NI. So, by Proposition 7.3, SI,NI is an n-DS. On the other hand, for each x,yLn(U) we have that ISI,NI,NIr(x,y)=SI,NI(NIr(x),y)=I(NI(NIr(x)),y)=I(x,y). So, I is an n-dimensional (S,N)-implication with (SI,NI,NIr) as the generator pair. □

7.3. (S,N)-Implications – the first axiom of Hilbert system and the identity principle

The Proposition 6.10 and Proposition 6.12 claim that each representable n-dimensional (S,N)-implication satisfies neither the first axiom of Hilbert system nor the identity principle. Nevertheless, there are n-dimensional (S,N)-implication satisfying I7 and I11, for instance, the n-dimensional version of the Weber-implication:

IWB(X,Y)={Y if X=/1//1/ otherwise. 

Proposition 7.5

Let I be n-dimensional (S,N) -implication. I satisfy I7 if and only if I satisfy I11 .

Proof

(⇒) Since by Proposition 7.2, I satisfies I3 then, by I3 and I7, for each xLn(U), I(x,x)=I(x,I(/1/,x))=/1/. Therefore, I satisfies I11.

(⇐) Let x,yLn(U). By I11 we have that, I(x,I(y,x))=S(N(x),S(N(y),x))=S(S(N(x),x),N(y)))=S(I(x,x),N(y))=S(/1/,N(y))=/1/. Therefore, I satisfies I7. □

Since not all (S,N)-implication, even S-implications, satisfy the identity principle, we analyze this property for this family in the following propositions.

Proposition 7.6

For an n-DS S and an n-DN N the following statements are equivalent:

  • (i)

    The (S,N) -implication IS,N satisfies I11 ;

  • (ii)

    The pair (S,N) satisfies LEM expressed as S5 .

Proof

If IS,N satisfies I11, then S(N(x),x)=I(x,x)=/1/, for all xLn(U).

Conversely, if the pair (S,N) satisfies S5, then I(x,x)=S(N(x),x)=/1/ for all xLn(U). Therefore, Proposition 7.6 is verified. □

Proposition 7.7

Let I be n-dimensional (S,N) -implication. If I satisfies I11 then inf{yLn(U):I(x,y)=/1/}x and N(x)inf{yLn(U):I(N(x),y)=/1/ .

Proof

For each xLn(U), by I11, I(x,x)=/1/ and therefore inf{yLn(U):I(x,y)=/1/}x. On the other hand, by I11, I(N(x),N(x))=/1/ and therefore inf{yLn(U):I(N(x),y)=/1/}N(x). Then, Proposition 7.7 holds. □

From the results achieved in Proposition 7.5, the Proposition 7.6, Proposition 7.7 also hold when I11 is substituted by I7.

7.4. (S,N)-Implications and the ordering property

As noted earlier, not all natural generalizations of the classical implication to multi-valued logic satisfy ordering property I12. In the following section we discuss results on (S,N)-implications with respect to their ordering property.

Lemma 7.1

Let I be n-dimensional (S,N) -implication satisfying I12 . Then NI(x)=inf{yLn(U):I(NI(x),y)=/1/} for each xLn(U) .

Proof

By I12, I(NI(x),NI(x))=/1/ and therefore NI(x)inf{yLn(U):I(NI(x),y)=/1/}. Suppose that NI(x)>inf{yLn(U):I(NI(x),y)=/1/} and take zLn(U) such that NI(x)>z>inf{yLn(U):I(NI(x),y)=/1/}. Then, there exist y{yLn(U):I(NI(x),y)=/1/} such that zy. So, by I2, I(NI(x),z)I(NI(x),y)=/1/ and therefore, by I12, NI(x)z which is a contradiction. Hence, NI(x)=inf{yLn(U):I(NI(x),y)=/1/}. Then, Proposition 7.1 holds. □

Theorem 7.2

Let I be n-dimensional (S,N) -implication. Then the following statements are equivalent:

  • (i)

    I satisfies I12 and I13(c) ;

  • (ii)

    NI is a strong negation and I satisfies I11 .

Proof

(i)(ii) Since I12 implies I11 and, by Proposition 7.2, I satisfies I3 and I5, then, by Proposition 6.4(2), we have that NI(NI(NI(x)))NI(x) for each xLn(U). But NI is right invertible and so has a right inverse, denoted by Nr. Then for each xLn(U), x=NI(Nr(x))NI(NI(NI(Nr(x))))=NI(NI(x)). Therefore, by Proposition 6.4(1), we conclude that NI(NI(x))=x.

(ii)(i) Since NI is strong, trivially is right invertible. Let x,yLn(U), I(x,y)=/1/. So, since NI is strong, it holds that

yinf{zLn(U):I(x,z)=/1/}=inf{zLn(U):I(N(N(x)),z)=/1/}.

Then, by Lemma 7.1, yNI(NI(x))=x. On the other hand, if xy then, because NI is strong, NI(NI(x))y and therefore, by Lemma 7.1, inf{zLn(U):I(N(x),z)=/1/}=NI(NI(x))y. So, I(N(x),y)=/1/. Therefore, Theorem 7.2 is verified. □

7.5. Representing of n-dimensional (S,N)-implication

As aforementioned, there is no representable n-dimensional (S,N)-implication satisfying the identity principle. However, this does not imply in the no existence of representable n-dimensional (S,N)-implication and the study of classes of representable n-dimensional (S,N)-implications deserves to be studied.

Proposition 7.8

Let S and N be representable n-DS and n-DN, respectively. Then, IS,N is representable.

Proof

Since S and N are representable then there exists t-conorms Si and fuzzy negations Ni, with i=1,,n, such that S=S1,,Sn˜ and N=N1,,Nn˜ and so obey the conditions stated in Proposition 5.1, Proposition 4.1. Then, we obtained the results below:

S(N(x),y))=S1,,Sn˜((N1(πn(x)),,Nn(π1(x))),(π1(y),,πn(y)))=(S1(N1(πn(x)),π1(y)),,Sn(Nn(π1(x)),πn(y)))=(IS1,N1(πn(x),π1(y)),,ISn,Nn(π1(x),πn(y)))=IS1,N1,,ISn,Nn˜(x,y).

Therefore, IS,N is also a representable function on Ln(U) and so, Proposition 7.8 holds. □

Proposition 7.9

Let S be a n-DS and N be a n-DN. If IS,N is representable then N is representable. In addition, if N is right invertible then S is representable.

Proof

Since I=IS,N is a representable n-dimensional (S,N)-implication then, by Proposition 6.7, each I(i) with iNn is an n-DI and I=I(1)I(n)˜. Then for each xLn(U), we have that N(x)=S(N(x),/0/)=I(x,/0/)=(I(1)(πn(x),0),I(n)(π1(x),0))=(NI(1)(πn(x)),,NI(n)(π1(x)))=NI(1)NI(n)˜(x), that is, N is representable. In addition, let Nr the right inverse of N. By Proposition 4.3, N(i) is right invertible and, Remark 4.3, holds that Nr is representable. Then, for x,yLn(U), N(Nr(x))=x, and we obtained the results below:

S(x,y)=S(N(Nr(x)),y)=I(Nr(x),y)=I(1),,I(n)˜(((Nr)(1)(πn(x)),,(Nr)(n)(π1(x))),(π1(y),,πn(y)))=(I(1)((Nr)(n)(π1(x)),π1(y)),,I(n)((Nr)(1)(πn(x)),πn(y)))=(S1(π1(x),π1(y)),,Sn(πn(x),πn(y)))

with Si(x,y)=I(i)((Nr)(ni+1)(x),y) for each iNn. Moreover, for each x,y,z[0,1] and iNn, we have that: Si(x,0)=πi(S(/x/,/0/))=πi(/x/)=x, Si(x,y)=πi(S(/x/,/y/))=πi(S(/y/,/x/))=Si(y,x), if yz then /y//z/ and so Si(x,y)=πi(S(/x/,/y/))πi(S(/x/,/z/))=Si(x,z). And, finally, since I(i) is an (S.N)-implication and I satisfies I5. Consequently, by Proposition 6.9, I(i) satisfies I5. So, we obtained the following results:

Si(x,Si(y,z))=I(i)((Nr)(ni+1)(x),I(i)((Nr)(ni+1)(y),z))=I(i)((Nr)(ni+1)(y),I(i)((Nr)(ni+1)(x),z))=Si(y,Si(x,z)).

Therefore, Si is associative and therefore, it is a t-conorm. And, Proposition 7.9 holds. □

Example 7.1

In the following, an example of a representable n-dimensional fuzzy implication is presented:

Let IKD,IRC,ILK,IFD:U2U be operators given by the expressions below:

  • IKD be the Kleene-Dienes (SM,NS)-implication: IKD(x,y)=SM(NS(x),y)=max(1x,y);

  • IRC be the Reichenbach (SP,NS)-implication: IRC(x,y)=SP(NS(x),y)=1x+xy;

  • ILK be the Lukasiewicz (SLK,NS)-implication: ILK(x,y)=SLK(NS(x),y)=min(1,1x+y);

  • IFD be the Fodor (SnM,NS)-implication: IFD(x,y)=SnM(NS(x),y)={max(1x,y),yx,1,otherwise.

  • (i)
    When x=(0.0,0.1,0.5,0.8) and y=(0.2,0.6,0.9,1.0), it holds that:
    IKD˜(x,y)=(IKD(0.8,0.2),IKD(0.5,0.6),IKD(0.1,0.9),IKD(0,1))=(0.2,0.6,0.9,1.0);IRC˜(x,y)=(IRC(0.8,0.2),IRC(0.5,0.6),IRC(0.1,0.9),IRC(0,1))=(0.36,0.8,0.99,1.0);ILK˜(x,y)=(ILK(0.8,0.2),ILK(0.5,0.6),ILK(0.1,0.9),ILK(0,1))=/1/;IFD˜(x,y)=(IFD(0.8,0.2),IFD(0.5,0.6),IFD(0.1,0.9),IFD(0,1))=(0.2,1.0,1.0,1.0).
  • (ii)
    Based on results in [6] and [5] we have that IKDIRCILK. So, see two examples of representable n-DI obtained from Eq. (17):
    IKD,IRC,ILK˜(x,y)=(max(1x3,y1),1x2+x2y2,min(1,1x1+y3)). (20)
    Therefore, the following results are obtained:
    IKD,IRC,ILK˜((0.1,0.5,0.8),(0.2,0.6,0.9))=(0.2,0.2,1.0).
  • (iii)
    Analogously, by results from [6] and [5], IKDIRCILKIFD and the following holds:
    IKD,IRC,ILK,IFD˜((0.0,0.1,0.5,0.8),(0.2,0.6,0.9,1.0))=(0.2,0.8,1.0,1.0).
  • (iv)

    And, if IIKD,IRC,ILK,IFD˜, S=SKD,SRC,SLK,SFD˜ and N=NS˜, it is immediate the following I(x,y)=S(N(x),y).

7.6. Conjugation of n-dimensional (S,N)-implication

Concluding this section, the next proposition extends the results in [7, Theorem 2.4.5.] and discusses the action of automorphisms on the class of n-dimensional fuzzy (S,N)-implication,

Proposition 7.10

If IS,N is an n-dimensional (S,N) -implication, then the φ-conjugate of IS,N is also an n-dimensional (S,N) -implication generated from the φ-conjugate of S and N , that is,

(IS,N)φ(x,y)=ISφ,Nφ(x,y). (21)

In addition, given φAut(Ln(U)) , we have that IS,N is representable if and only if (IS,N)φ is representable.

Proof

Let φAut(Ln(U)) and let S,N be an n-DS and an n-DN, respectively. So, by Proposition 5.5, Proposition 4.5, the functions Sφ,Nφ are also an n-DS and an n-DN, thus

(IS,N)φ(x,y)=φ1(IS,N(φ(x),φ(y)))=φ1(S(N(φ(x)),φ(y))) by Eqs. (10) and (19)=φ1(S(φ(φ1(N(φ(x)))),φ(y)))=Sφ(Nφ(x),y) by Eq. (10)=ISφ,Nφ(x,y) by Eq. (19).

Therefore, (IS,N)φ is an n-dimensional (S,N)-implication. In addition, by Proposition 6.7, IS,N is representable if and only if (IS,N)φ is also representable. Therefore, Proposition 7.10 is verified. □

8. Exploring n-dimensional fuzzy (S,N)-implication in approximate reasoning

Owing to the effective and reasonable description to the uncertainty information, the expression ability related to the concepts in the n-dimensional simplex Ln(U) is stronger than Zadeh's fuzzy sets. So, in this section, first results in the extension of the basic concepts of AR are considered, by using n-dimensional intervals. In particular, the class of n-dimensional fuzzy (S,N)-implication can be employed to relate fuzzy propositional formulae in n-dimensional fuzzy logic inference schemes. For example, if A, B are any n-dimensional fuzzy logic propositional formulae, then AB is called an n-dimensional fuzzy conditional statement or more commonly, as an n-dimensional fuzzy IF-THEN rule and it is again interpreted as “A implies B”. This construction can be carried out considering both aspects:

  • (i)

    n-dimensional intervals and fuzzy statements

    An expression of the form “x is A” is termed as a fuzzy statement, where A is an n-dimensional fuzzy set on the n-dimensional simplex Ln(U), with reference to the context. Thus, we can say that the above statement can be interpreted as follows:
    • Let “x is A” and also that x assumes the precise value, let us say, μA(x)=uLn(U), the domain of A. Then the truth value of the above fuzzy statement is obtained as t(x is A)=A(u). Thus, the greater the membership degree of x in the concept A is, the higher the truth value of the fuzzy statement.
    While in the above case a fuzzy statement was looked upon as a fuzzy proposition to be evaluated based on some precise information, it can also be used to express something precise when the only information regarding the variable x is imprecise.
  • (ii)

    n-dimensional intervals compounding n-dimensional IF-THEN rules

    We can also interpret an n-dimensional fuzzy statement as a linguistic statement on the suitable domain Ln(U). Then A represents a concept and hence can be thought of as a linguistic value. Then a symbol x can assume or be assigned to a linguistic value. Then a linguistic statement “x is A” is interpreted as the linguistic variable x taking the linguistic value A.

8.1. n-Dimensional intervals and inference schemes in approximate reasoning

This section describes a structure in the fuzzy rules of deduction for inference schemes in AR on the n-dimensional simplex domain, which is analogous to the fuzzy logic approach.

In the GMP methodology, a fuzzy logic rule of deduction considers an inequality explicit by a conjunction, defined as an n-dimensional t-norm T together with an n-dimensional fuzzy (S,N)-implication.

The inference schemes are performed based on the combination-projection principle, providing the Compositional Rules of Inference (CRI) [44], which has the structure fuzzy rules based on the GMP inference patterns as follows:

  • (i)

    the fuzzy rule has the form “IF x is A THEN y is B”, and the fact “x is A”;

  • (ii)

    a conclusion to be drawn has the form “y is B” when A,AF and B,BF.

In fuzzy approach, neither A is necessarily identical to A nor B is also necessarily identical to B.

8.2. Compositional rule of inference on Ln(U)

This section describes the application of compositional rules of inference (CRI) systems on Ln(U). For that, let FSχ be the set of all n-dimensional fuzzy sets w.r.t. a universe χ.

The Cartesian Product among n-DFS is given in the next definition.

Definition 8.1

Let χ1,,χm be non-empty and finite universe-sets and, for each iNm, AiFSχi. Then, the Cartesian Product A1××AmΠiNm(Ai) w.r.t. the universe-set χ1××χmΠiNm(χi) is the function ΠiNm(Ai):ΠiNm(χi)(Ln(U))m defined as follows

ΠiNm(Ai)(x1,,xm)=(A1(x1),,Am(xm)),x1χ1,,xmχm.

In particular, let A1,,AmFS(χ) w.r.t. the same universe χ={xj:jN#χ}. So, when iNm, for each AiFS(χ) the related membership function μAi:χLn(U) is given as μAi(xj)Ai(xj)=xij, jN#χ. The Cartesian Product of these n-DFS is given in the next definition.

Definition 8.2

Let χ be a non-empty and finite universe-set and A={A1,,A#A}FSχ. Taking #A=m, then the Cartesian Product of the n-dimensional fuzzy sets A1,,Am, which is denoted as A1××AmΠjNm(Aj), is the function μΠjNm(Aj)ΠjNm(Aj):χm(Ln(U))m defined as follows

ΠiNm(Ai)(x1,,xm)=(A1(x1),,Am(xm)),(x1,,xm)χm.

Clearly, ΠjNm(Aj)(x1,,xm) is well defined. Moreover, for each (x1,,xm)χm, we have that ΠjNm(Aj)(x1,xm)=(x1,,xm)(Ln(U))m. Thus, the relation ΠjNm(Aj) can be expressed as a matrix X on (Ln(U))m×l given as

X=(xij)m×l=(ΠiNm(Ai)(xj))jNl,

where l=#χ and whose elements xij=Ai(xj)Ln(U), for all iNm and jNl.

Definition 8.3

Let P={P1,,Pl} be a family of n-dimensional m-ary aggregation functions, χ be a non-empty and finite universe-set, l=#χ and A={A1,,Am}FSχ. An operator P:(Ln(U))m×l(Ln(U))l is defined as follows

P(X)=P((ΠiNm(Ai)(xj))jNl)=(Pj(A1(xj),,Am(xj)))jNl. (22)

The expression given by Eq. (22) provides a method to generate new members on FSχ, based on the action of a family of aggregation operators.

Example 8.1

Let χ={1,2}, meaning that iN2. For each jN4, consider the 4-dimensional fuzzy sets A={A1,A2,A3} over χ defined as follows

πj(A1(xi))=xinj+2A1={(0.2,0.25,0.3,0.5),(0.4,0.5,0.6,1.0)};πj(A2(xi))=xinj+3A2={(0.16,0.2,0.25,0.5),(0.3,0.4,0.5,0.6)};πj(A3(xi))=xinj+4A3={(0.14,0.16,0.2,0.25),(0.28,0.3,0.4,0.5)}.

Now, taking the associative operators ,:(L4(U))3×2(L4(U))2 we have that

((ΠiN3(Ai)(xj))jN2)=((A1(x1),A2(x1),A3(x1)),(A1(x2),A2(x2),A3(x2)));=((0.14,0.16,0.2,0.25),(0.28,0.3,0.4,0.5))((ΠiN3(Ai)(xj))jN2)=((A1(x1),A2(x1),A3(x1),(A1(x2),A2(x2),A3(x2)))=((0.2,0.25,0.3,0.5),(0.4,0.5,0.6,1.0)).

Definition 8.4

[48] Let χ1,χ2 be finite, nonempty sets and A={A1,A2}FSχi. The cartesian product of the n-DFS A1 and A2 related to an n-dimensional t-norm T is an n-dimensional fuzzy set on FSχ1×χ2 defined as follows:

T(A1,A2)(x1,x2)=T(A1(x1),A2(x2)),x1χ1,x2χ2.

Analogously, an IF-THEN rule is represented by a binary n-dimensional fuzzy relation RI(A1,A2):(Ln(U))2Ln(U) given as:

RI(A1,A2)(x1,x2)=I(A1(x1),A2(x2)),x1χ1,x2χ2 (23)

when I is usually an n-dimensional fuzzy (S,N)-implication and A1,A2 are n-dimensional fuzzy sets on their respective universe domains χ1,χ2.

Therefore, given a fact “x1 is A1”, the inferred output “x2 is A2” is obtained as sup-T composition of A1(x1) and RI(A1,A2)(x1,x2), as follows:

A2(x2)=(A1TRI(A1,A2))(x2)=x1χ1T(A1(x1),RI(A1,A2)(x1,x2))=x1χ1T(A1(x1),I(A1(x1),A2(x2))). (24)

Let A1,A2,A3 be n-DFS on their respective universe domains χ1,χ2,χ3. So, considering the two following cases:

  • 1.
    Firstly, considering a SISO system given by Eq. (24) attaining normality at an x1χ1, then the related output constructing when the input A1 is the singleton n-dimensional fuzzy set A1(x)=/1/ for each xχ1, is obtained as follows:
    A2(x2)=A1(x1)TRI(A1,A2)(x1,x2)=x1χ1T(A1(x1),RI(A1,A2)(x1,x2))=T(/1/,RI(A1,A2)(x1,x2))=RI(A1,A2)(x1,x2).
  • 2.
    And, in the another case, considering the rule-base in a Multi-Input Single-Output (MISO) system, the relation R is given by
    R(A1(x1),,Am(xm),Am+1(xm+1))=I(i=1mAi(xi),Am+1(xm+1)), (25)
    where operator ⨀, called the n-dimensional antecedent combiner, is usually given as an m-ary n-dimensional t-norm as in Eq. (15). Thus, we have i=1mAi(xi defines the Cartesian Product between Ai's with respect to an m-ary n-dimensional t-norm ⨀. So, given a multiple-input (A1,A2) and taking the sup-TM composition, the inferred output Am+1 is given by the following expression:
    Am+1=(A1,,Am)T((A1,,Am)Am+1). (26)
    Then, by applying results of Eq. (26), for all xm+1χm=1, we obtain the following expression for an output in the IF-THEN base-rule in a MISO system:
    Am+1(xm+1)=(x1,,xm)χ1××χmT(i=1mAi(xi),I(i=1mAi(xi),Am+1(xm+1))). (27)

So, when m=2, ⨀ is in fact an n-dimensional t-norm, just denoted by ⊙. In the following, an example exploring the structure presented in Eq. (27) for m=2 and considering the n-DFS A1 and A2 as singleton inputs, is presented.

8.3. Exemplification of IF-THEN base-rule in MISO n-dimensional fuzzy system

Consider a virtual application in developing method to medical diagnosis for a patient-analysis with the given five symptoms: fever (a1), sore throat (a2), (head)ache (a3), (dry)cough (a4), anosmia (a5), which are described in terms of L3(U)-fuzzy set theory by χA={a1,,a5} in order to contemplate the opinions of three experts from distinct researches areas (infectology, epidemiology, and pneumology).

In addition, consider the medical knowledge base components: Influenzavirus Subtype A-H1N1 (b1), COVID-19 (b2) and Atopic Bacterial Pneumonia (b3), which can enable a proper diagnosis from the set χB={b1,b2,b3}. The resulting data provide the worst, moderate and best estimates to each one of diagnoses, modeled by χC={c1,c2,c3} in L3(U).

The proposed computational evaluation process is conceived to add degrees of freedom and to directly model uncertainty levels of experts knowledge, also including uncertain words from natural language and possible repetition of parameters related to the collected data.

So, let χA={a1,,a5}, χB={b1,b2,b3} and χC={c1,c2,c3} be universe-sets related to the membership function A:χ1(L3(U))5, B:χ2(L3(U))3 and A:χ3(L3(U))3, defining the corresponding 3-DFS in the following:

A=(x1,,x5)(L3(U))5,B=(y1,,y3)(L3(U))3,C=(z1,,z3)(L3(U))3.

where xi=A(ai), yi=B(bi) and zi=C(ci) for each iN5 and j,kN3. In this application, instances of such 3-DFS are, respectively, given as follows:

A=((0.55,0.6,0.65),(0.45,0.50,0.55),(0.35,0.40,0.45),(0.35,0.40,0.45),(0.60,0.65,0.70)),B=((0.75,0.80,0.85),(0.35,0.40,0.45),(0.55,0.60,0.65)),C=((0.10,0.15,0.20),(0.15,0.20,0.25),(0.20,0.25,0.30)).

Let A=(/0/,/0/,/1/,/0/,/0/)(L3(U))5, B=(/0/,/1/,/0/)(L3(U))3 as the given singleton inputs. Moreover, we consider the following operators:

  • (i)

    TLK,TP,TM˜, the representable n-DT modeling the Cartesian Product operator (see, Example 5.1);

  • (ii)

    IKD,IRC,ILK˜, the representable n-dimensional fuzzy implication (see, Example 7.1, Eq. (20));

  • (iii)

    (,TM˜), the operators providing the supTM composition, (see, Example 5.1).

By Eq. (27), the expression of IF-THEN base-rules in MISO n-DFL is given as follows:

C(z)=(x,y)χ1×χ2TM˜((A(x),B(y)),I((A(x),B(y)),C(z))),=(x,y)χ1×χ2(TM˜(TLK,TP,TM˜(A(x),B(y)),IKD,IRC,ILK˜((A(x),B(y)),C(z)))),zχ3. (28)

The steps to consolidate Eq. (28) are described in the following.

  • (I)
    Firstly, the Cartesian Product A×B considering TLK,TP,TM˜ is defined as follows:
    wij=TLK,TP,TM˜(xi,yj)=(TLK(π1(xi),π1(yj)),TP(π2(xi),π2(yj)),TM((π3(xi),π3(yj))),iN5,jN3.
    where xi=A(ai) and yj=B(bj) for each iN5 and jN3. Thus, for example, the first component, taking i=j=1 is given as
    w11=TLK,TP,TM˜(x1,y1)=(TLK(0.55,0.75),TP(0.60,0.80),TM(0.65,0.85))=(max(0.55+0.751,0),0.600.80,min(0.65,0.85))=(0.30,0.48,0.65).
    Analogously, the other components can be obtained. They are described as a matrix structure below:
    (wij)iN5,jN3=((0,30,0,48,0,65)(0,00,0,24,0,45)(0,10,0,36,0,65)(0,20,0,40,0,55)(0,00,0,20,0,45)(0.00,0,30,0,55)(0,10,0,32,0,45)(0,00,0,16,0,45)(0.00,0,24,0,45)(0,10,0,32,0,45)(0,00,0,16,0,45)(0.00,0,24,0,45)(0,35,0,52,0,70)(0,00,0,26,0,45)(0,15,0,39,0,65))
  • (II)

    Let IKD,IRC,ILK:U2U be the (S,N)-implications given in Example 7.1 related to representable n-DI IKD,IRC,ILK˜:(L3(U))2L3(U) reported in Example 7.1, Eq. (20).

    In the following, see the results from operator
    (vij)k=IKD,IRC,ILK˜(wij,zk),iN5,j,kN3. (29)
    where zk=C(ck) for each kN3. For k=i=1 and jN3:
    (v1j)1=IKD,IRC,ILK˜(w1j,c1)=(IKD(π3(w1j),π1(c1)),IRC(π2(w1j),π2(c1)),ILK((π3(w1j),π3(c1)))(v11)1=IKD,IRC,ILK˜(w11,c1)=IKD,IRC,ILK˜((0.30,0.48,0.65),(0.10,0.15,0.20))=(IKD(0.65,0.10),IRC(0.48,0.15),ILK(0.30,0.20))=(max(10.65;0.10),10.48+0.480.15,min(1,10.30+0.20))=((0.350,0.592,0.9000)(v12)1=IKD,IRC,ILK˜(w12,c1)=IKD,IRC,ILK˜((0.00,0.24,0.45),(0.10,0.15,0.20))=(IKD(0.45,0.10),IRC(0.24,0.15),ILK(0.00,0.20))=(max(10.45;0.10),10.24+0.240.15,min(1,10.00+0.20))=((0.550,0.796,1.0000)(v13)1=IKD,IRC,ILK˜(w13,c1)=IKD,IRC,ILK˜((0.10,0.36,0.65),(0.10,0.15,0.20))=(IKD(0.65,0.10),IRC(0.36,0.15),ILK(0.10,0.20))=(max(10.65;0.10),10.36+0.360.15,min(1,10.10+0.20))=((0.350,0.694,1.0000)
    Then, the above results constitute the first line in the [(vij)1]-matrix. The other coefficients can be analogous obtained. See the final results concluding this step in the three matrices [(vij)1], [(vij)2] and [(vij)3] in the following:
    [(vij)1]=((0.3500,0.5920,0.9000),(0.5500,0.7960,1.0000),(0.3500,0.6940,1.0000)(0.4500,0.5400,1.0000),(0.5500,0.8300,1.0000),(0.4500,0.7450,1.0000)(0.5500,0.7280,1.0000),(0.5500,0.8640,1.0000),(0.5500,0.79601.0000)(0.5500,0.7280,1.0000),(0.5500,0.8640,1.0000),(0.5500,0.79601.0000)(0.3000,0.5580,0.8500),(0.5500,0.7790,1.0000),(0.35000.6685,1.0000))[(vij)2]=((0.3500,0.6160,0,9500)(0,5500,0.8080,1.0000)(1,0000,0.7120,1.0000)(0.4500,0.6800,1.0000)(0.5500,0.8400,1.0000)(1,0000,0.7600,1.0000)(0.5500,0.7440,1.0000)(0.5500,0.8720,1.0000)(1,0000,0.8080,1,0000)(0.5500,0.7440,1.0000)(0.5500,0.8720,1.0000)(1,0000,0.8080,1,0000)(0.3000,0.5840,0.9000)(0.7323,0.7920,0.8425)(1,0000,0.6880,1,0000))[(vij)3]=((0.3500,0.6400,0.9500)(0.2000,0.8200,1.0000)(0.3500,0.7300,1.0000)(0.4500,0.7000,1.0000)(0.2000,0.8500,1.0000)(0.4500,0.7750,1.0000)(0.5500,0.7600,1.0000)(0.2000,0.8800,1.0000)(0.5500,0.8200,1.0000)(0.5500,0.7600,1.0000)(0.2000,0.8800,1.0000)(0.5500,0.8200,1.0000)(0.3000,0.6100,0.9000)(0.2000,0.8050,1.0000)(0.3500,0.7075,1.0000))
  • (III)
    The Cartesian Product A×B also considers the n-DT TLK,TP,TM˜ and, iN5,jN3, such operator is defined by as follows:
    uij=TLK,TP,TM˜(xi,yj)=(TLK(π3(xi),π1(yi)),TP(π2(xi),π2(yi)),TM((π1(xi),π3(yi))),
    and graphically represented by the matrix below:
    [uij]iN5,jN3=TLK,TP,TM˜(x,y)=(/0//0//0//0//0//0//0//1//0//0//0//0//0//0//0/).
  • (IV)
    For each iN5, jN3. Consider (t(ij))kN3=(TM˜(uij,vij))kN3 resulting on the matrices below:
    [t1]=(/0//0//0//0//0//0//0/(0.550,0.864,1.000)/0//0//0//0//0//0//0/) (30)
    [t2]=(/0//0//0//0//0//0//0/(0.550,0.872,1.000)/0//0//0//0//0//0//0/) (31)
    [t3]=(/0//0//0//0//0//0//0/(0.200,0.880,1.000)/0//0//0//0//0//0//0/) (32)
  • (V)
    Concluding, in the TM˜ composition, we apply the operator :(L3(U))5(L3(U)) considering the five lines of each matrix [t1], [t2] and [t3]. It results on the following n-DFS:
    C=kN3(t(ij))kC=((0.550,0.864,1.000),(0.550,0.872,1.000),(0.200,0.880,1.000))

The constructor of IF-THEN base-rules in MISO n-DFL can be obtained considering other three operators, as reported in Table 1 . In these cases, the first pair-operators defined as (TM,TP,TLK˜; IKD,IRC,ILK˜) presents in the same execution inference of based-rules, the worst, moderate and best estimates. In addition, it also partially includes results from other pairs (TM˜;IKD˜), (TP˜;IRC˜) and (TLK˜;ILK˜), as emphasized by bold numbers.

Table 1.

The constructor of IF-THEN base-rules in MISO n-DFL.

(T,I)-operator Results from CRI Execution on (L3(U))3
(TM,TP,TLK˜; IKD,IRC,ILK˜) ((0.5500,0.8640,1.0000),(0.5500,0.8720,1.0000),(0.2000,0.8800,1.0000))
(TM˜;IKD˜) ((0.5500,0.6000,0.6500),  (0.5500,0.6000,0.6500),  (0.2000,0.6000,0.6500))
(TP˜;IRC˜) ((0.8178,0.8640,0.9020),  (0.8279,0.8720,0.9881),  (0.8380,0.8800,0.9143))
(TLK˜;ILK˜) ((1.0000,1.0000,1.0000),  (1.0000,1.0000,1.0000),  (1.0000,1.0000,1.0000))

9. Conclusion

This work discussed the n-dimensional interval fuzzy implications, considering the study of continuity, duality, conjugation and their representability based on fuzzy implications from U to Ln(U).

As the main contribution, relevant properties characterizing the class of n-dimensional interval (S,N)-implications on Ln(U) are studied. In sequence, this study contemplated the discussion of such extension of fuzzy connectives on Ln(U). It is worth mentioning that we considered the case and provided a characterization in Theorem 7.1, for n-dimensional interval (S,N)-implications on Ln(U) when the n-DN is right reversible. Moreover, since n-DFS generalize fuzzy sets and interval-valued fuzzy set and such class of (interval-valued) (S,N)-implications were not studied, then Theorem 7.1 can also contribute in the study of (interval-valued) (S,N)-implications. In particular, once right invertible fuzzy negation generalizes continuous fuzzy negations, then this result generalizes the characterization of continuous (interval-valued) (S,N)-implications, as presented in [7, Theorem 2.4.10]. In addition, n-dimensional intervals and inference schemes in approximate reasoning were presented and an example was also developed.

Since inherent ordering related to n-dimensional intervals, admissible linear orders contributing with research areas as making decisions based on multi-attributes. Ongoing work overcomes the restriction of selected representable n-DFI verifying the increasing sequence of fuzzy implications, by considering the use of admissible linear ⪯-orders on Ln(U) as studied in [20]. Thus, we intend to analyze properties as anti/iso monotonicity, continuity, reversibility w.r.t. admissible ⪯-orders on Ln(U).

Further work also considers studying other special classes of fuzzy implications as D-, QL- and R-implications and others as power-implications, Yager-implications, (T,N)-implications and H-implications.

Concluding, the studied properties in the class of n-dimensional interval (S,N)-implications on Ln(U) unable us to apply the obtained results in definition of new consensus measures in the sense as proposed by Beliakov [17].

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Acknowledgement

This work was partially supported by CAPES/Brasil, Brazilian Funding Agency CAPES, MCTI/CNPQ Universal (448766/ 2014-0), PQ (309160/2019-7 and 310106/2016-8) and PqG/FAPERGS 2017/02 (19/2551-0000552-0).

2

For more details on continuity of Ln(U)-valued function see [33], [34].

1

A function f:AB is right invertible if there exists a function g:BA such that f(g(x))=x for reach xB.

References

  • 1.Alcalde C., Burusco A., Fuentes-Gonzalez R. A constructive method for the definition of interval-valued fuzzy implication operators. Fuzzy Sets Syst. 2005;153:211–227. [Google Scholar]
  • 2.Atanassov K. Proc. VII ITKR's Session. 1983. Intuitionistic fuzzy sets. pp.1697–1684. [Google Scholar]
  • 3.Atanassov K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986;20:87–96. [Google Scholar]
  • 4.Atanassov K., Gargov G. Elements of intuitionistic fuzzy logic Part I. Fuzzy Sets Syst. 1989;95:39–52. [Google Scholar]
  • 5.Baczyński M. On some properties of intuitionistic fuzzy implications. 3rd Conference of the European Society for Fuzzy Logic and Technology; Zittau, Germany; 2003. pp. 168–171. [Google Scholar]
  • 6.Baczyński M., Jayaram B. On the characterizations of (S,N)-implications. Fuzzy Sets Syst. 2007;158(15):1713–1727. [Google Scholar]
  • 7.Baczyński M., Jayaram B. Springer; Berlin: 2008. Fuzzy Implications, vol. 231. [Google Scholar]
  • 8.Bedregal B., Santiago R., Reiser R., Dimuro G. The best interval representation of fuzzy S-implications and automorphisms. IEEE International Fuzzy Systems Conference; London, 2007; 2007. pp. 1–6. [DOI] [Google Scholar]
  • 9.Bedregal B., Dimuro G., Santiago R., Reiser R. On interval fuzzy S-implications. Inf. Sci. 2010;180:1373–1389. [Google Scholar]
  • 10.Bedregal B., Beliakov G., Bustince H., Calvo T., Fernandez J., Mesiar R., Paternain D. A characterization theorem for t-representable n-dimensional triangular norms. In: Melo-Pinto P., Couto P., Serôdio C., Fodor J., De Baets B., editors. Eurofuse 2011. vol. 107. Springer; Berlin, Heidelberg: 2011. pp. 103–112. (Advances in Intelligent and Soft Computing). [DOI] [Google Scholar]
  • 11.Bedregal B., Beliakov G., Bustince H., Calvo T., Mesiar R., Paternain D. A class of fuzzy multisets with a fixed number of memberships. Inf. Sci. 2012;189:1–17. [Google Scholar]
  • 12.Bedregal B., Beliakov G., Bustince H., Fernandez J., Pradera A., Reiser R. Springer; Berlin, Heidelberg: 2012. Negations Generated by Bounded Lattices t-Norms; pp. 326–335. [Google Scholar]
  • 13.Bedregal B., Mezzomo I. Ordinal sums and multiplicative generators of the De Morgan triples. J. Intell. Fuzzy Syst. 2018;34(4):2159–2170. [Google Scholar]
  • 14.Bedregal B., Reiser R., Bustince H., Lopez-Molina C., Torra V. Aggregation functions for typical hesitant fuzzy elements and the action of automorphisms. Inf. Sci. 2014;255:82–99. [Google Scholar]
  • 15.Bedregal B., Mezzomo I., Reiser R. n-dimensional fuzzy negations. IEEE Trans. Fuzzy Syst. 2018;26(6):3660–3672. [Google Scholar]
  • 16.Bedregal B., Santiago R.H.N. Interval representations, Łukasiewicz implicators and Smets-Magrez axioms. Inf. Sci. 2013;221:192–200. [Google Scholar]
  • 17.Beliakov G., Calvo T., James S. Consensus measures constructed from aggregation functions and fuzzy implications. Knowl.-Based Syst. 2014;55:1–8. [Google Scholar]
  • 18.Bustince H., Barrenechea E., Pagola M., Fernandez J., Xu Z., Bedregal B., Montero J., Hagras H., Herrera F., Baets B. A historical account of types of fuzzy sets and their relationships. IEEE Trans. Fuzzy Syst. 2015;24:179–194. [Google Scholar]
  • 19.Cruz A.P., Bedregal B.C., Santiago R.H.N. On the Boolean-like law I(x,I(y,x))=1. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 2014;22(2):205–216. [Google Scholar]
  • 20.De Miguel L., Sesma-Sara M., Elkano M., Asiain M.J., Bustince H. An algorithm for group decision making using n-dimensional fuzzy sets, admissible orders and OWA operators. Inf. Fusion. 2017;37:126–131. [Google Scholar]
  • 21.Driankov D., Hellendoorn H., Reinfrank M. Springer Science & Business Media; 2013. An Introduction to Fuzzy Control. [Google Scholar]
  • 22.Fodor J., Roubens M. Springer; Netherlands: 1994. Fuzzy Preference Modelling and Multicriteria Decision Support. (Theory and Decision Library D). [Google Scholar]
  • 23.Goguen J.A. L-fuzzy sets. J. Math. Anal. Appl. 1967;18(1):145–174. [Google Scholar]
  • 24.Gorzalczany M.B. A method of inference in approximate reasoning based on interval-valued fuzzy sets. Fuzzy Sets Syst. 1987;21(1):1–17. [Google Scholar]
  • 25.Klement E., Mesiar R., Pap E. Springer; Netherlands: 2000. Triangular Norms. [Google Scholar]
  • 26.Klement E., Mesiar R., Pap E. Triangular norms - position paper I: basic analytical and algebraic properties. Fuzzy Sets Syst. 2004;143(1):5–26. [Google Scholar]
  • 27.Li X.S., Yuan X.H., Lee E.S. The three-dimensional fuzzy sets and their cut sets. Comput. Math. Appl. 2009;58:1349–1359. [Google Scholar]
  • 28.Liu H. Fully implicational methods for approximate reasoning based on interval-valued fuzzy sets. J. Syst. Eng. Electron. 2010;21:224–232. [Google Scholar]
  • 29.Mas M., Monserrat M., Torrens J., Trillas E. A survey on fuzzy implication functions. IEEE Trans. Fuzzy Syst. 2007;15(6):1107–1121. [Google Scholar]
  • 30.Mezzomo I., Bedregal B. New results about De Morgan triples. Fourth Brazilian Conference on Fuzzy Systems (IV CBSF); Campinas, SP; 2016. pp. 83–93. [Google Scholar]
  • 31.Mezzomo I., Bedregal B., Reiser R., Bustince H., Paternain D. On n-dimensional strict fuzzy negations. 2016 IEEE Intl. Conference on Fuzzy Systems (FUZZ-IEEE); Vancouver, BC; 2016. pp. 301–307. [DOI] [Google Scholar]
  • 32.Mezzomo I., Bedregal B., Reiser R. Natural n-dimensional fuzzy negations for n-dimensional t-norms and t-conorms. 2017 IEEE Intl. Conference on Fuzzy Systems (FUZZ-IEEE); Naples; 2017. pp. 1–6. [DOI] [Google Scholar]
  • 33.Mezzomo I., Bedregal B., Milfont T. Moore continuous n-dimensional interval fuzzy negations. 2018 IEEE Intl. Conference on Fuzzy Systems (FUZZ-IEEE); Rio de Janeiro; 2018. pp. 1–6. [DOI] [Google Scholar]
  • 34.Mezzomo I., Bedregal B., Milfont T. n-dimensional interval uninorms. 2019 IEEE Intl. Conference on Fuzzy Systems (FUZZ-IEEE); New Orleans, LA, USA; 2019. pp. 1–6. [DOI] [Google Scholar]
  • 35.Pekala B. vol. 367. Springer; 2019. Uncertainty Data in Interval-Valued Fuzzy Set Theory - Properties, Algorithms and Applications; pp. 1–156. (Studies in Fuzziness and Soft Computing). [Google Scholar]
  • 36.Reiser R., Bedregal B. Correlation in interval-valued Atanassov's intuitionistic fuzzy sets - conjugate and negation operators. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 2017;25:787–819. [Google Scholar]
  • 37.Sambuc R. 1975. Function Φ-Flous, Application a l'aide au Diagnostic en Pathologie Thyroidienne. These de Doctorat en Medicine Univ. Marseille, Marseille, France. [Google Scholar]
  • 38.Shang Y., Yuan X., Lee E. The n-dimensional fuzzy sets and Zadeh fuzzy sets based on the finite valued fuzzy sets. Comput. Math. Appl. 2010;60:442–463. [Google Scholar]
  • 39.Shi Y., Ruan D., Kerre E.E. On the characterizations of fuzzy implications satisfying I(x,y)=I(x,I(x,y)) Inf. Sci. 2007;177:2954–2970. [Google Scholar]
  • 40.Torra V., Narukawa Y. 2009 IEEE Intl. Conference on Fuzzy Systems (FUZZ-IEEE) 2009. On hesitant fuzzy sets and decision; pp. 1378–1382. [Google Scholar]
  • 41.Torra V. Hesitant fuzzy sets. Int. J. Intell. Syst. 2010;25:529–539. [Google Scholar]
  • 42.Trillas E., Valverde L. On some functionally expressable implications for fuzzy set theory. Proc. 3rd Inter Seminar on Fuzzy Set Theory; Linz, Austria; 1981. pp. 173–190. [Google Scholar]
  • 43.Trillas E., Mas M., Monserrat M., Torrens J. On the representation of fuzzy rules. Int. J. Approx. Reason. 2008;48:583–597. [Google Scholar]
  • 44.Zadeh L. Outline of a new approach to the analysis of complex systems and decision processes. IEEE Trans. Syst. Man Cybern. 1973:28–44. [Google Scholar]
  • 45.Zadeh L. The concept of a linguistic variable and its application to approximate reasoning - I. Inf. Sci. 1975;8:199–249. [Google Scholar]
  • 46.Zanotelli R., Reiser R., Bedregal B. n-dimensional intervals and fuzzy s-implications. 2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE); Rio de Janeiro; 2018. pp. 1–8. [DOI] [Google Scholar]
  • 47.Zanotelli R., Reiser R., Bedregal B., Mezzomo I. Study on n-dimensional R-implications. 11th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT 2019); Prague, Czech Republic; 2019. pp. 474–481. [DOI] [Google Scholar]
  • 48.Zanotelli R., Reiser R., Bedregal B., Mezzomo I. Towards inference schemes in approximate reasoning using n-dimensional fuzzy logic. 5th Workshop-School on Theoretical Computer Sciences (WEIT 2019); Passo Fundo, Brazil; 2019. pp. 243–251. [Google Scholar]

Articles from International Journal of Approximate Reasoning are provided here courtesy of Elsevier

RESOURCES