PUIIZ ¥

sets and systems

ELSEVIER Fuzzy Sets and Systems 78 (1996) 293-303

Structures on intuitionistic fuzzy relations

H. Bustince*, P. Burillo
Departamento de Matem~tica e InformMica, Universidad Pftblica de Navarra, 31006, Campus Arrosadia, Pamplona, Spain
Received October 1994; revised February 1995

Abstract
In this paper we study the structures of the intuitionistic fuzzy relations. We analyse the existent relations between
the structures of a relation and the structures of its complementary one. We finish characterizing certain structures of
intuitionistic relations according to the structures of two concrete fuzzy relations.
Keywords: Intuitionistic fuzzy relation; Composition of intuitionistic fuzzy relation; Fuzzy relation; Atanasso's operator;
Intuitionistic ordering relation

I. Introduction

Let X, Y and Z be ordinary finite non-empty sets.

Let X 5~ ~b be a given set [1]. An intuitionisticfuzzy set in X is an expression A given by

A = {(x, re(x), vA(x))lx c X},

where

~A : X - - - , [ 0 , 1 ] , vA : X ~ [ 0 , 1 ] ,

with the condition

0 <~pA(x) + v~(x)<~ 1

for all x in X.
The numbers #A(x) and VA(X) denote, respectively, the degree o f membership and the degree o f non-
membership o f the element x in the set A. We will denote I F S s ( X ) the set o f all the intuitionistic fuzzy sets
in X. Obviously, when

vA(x) = 1 - I~A(x)

for every x in X, the set A is a fuzzy set. We will denote F S s ( X ) the set of all the fuzzy sets in X.

* Corresponding author. Tel.: 3448169254, Fax: 3448169565, E-mail: bustince@si.upna.es.

294 H. Bustince. P. Burillo/ Fuzz), Sets and Systems 78 (1996) 293-303

We will call

7zA(x) = 1 -/JA(X) - - VA(X)

intuitionistic index of the element x in the set A.

The following expressions are defined in [1,2,5] for every A,B E IFSs(X)
1. A ~<B if and only ifpA(x)~<pn(x) and vA(x)>~vs(x) for all x E X
2. A _~ B if and only if/JA(X)<-..pB(X) and VA(X)<~VB(X) for all x E X
3. A = B if and only ifA<~B and B~<A
4. Ac = {(X, VA(X),/JA(X)}ix E X}.
In 1986, Atanassov established different ways of changing an intuitionistic fuzzy set into a fuzzy set and
he defined the following operator:
If E E 1FSs(X), then

D p ( E ) = {{x,/JE(X ) + p . ~zE(x), 1 -- /JE(X)-- p" IrE(X)}[X • X}, (1)

with p • [0, 1]. Obviously, Dp(E) E FSs(X).

A study of the properties of this operator (we will call it Atanassov's operator) is made in [3,6].
Let E be an intuitionistic fuzzy set and Dp the operator given in the previous definition, then the family
of all fuzzy sets associated to E through the operator Dp, will be denoted by {Dp(E)}pE[O,1]. It is clear that
{Dp(E)}pE[o,1 ] is a totally ordered family of fuzzy sets.
It is worth pointing out that for any intuitionistic fuzzy set E:

/J(Do(E))(X) : /JE(X), /J(D,(E))c(X) = rE(X) (2)

are verified for every x in X, which will be used very much in the last part of this paper.
We know that an intuitionistic fuzzy relation is an intuitionistic fuzzy subset of X x Y, that is, is an
expression R given by

R = {((x,y),/ja(x,y),vR(x,y)}lx EX, y ~ Y},

where

/JR : X x Y ~ [0,1], vR : X x Y---~ [0,1]

satisfy the condition O<~/jR(x, y) + v~c(x,y)<~ l for every (x, y) E X x Y.

We will denote with IFR(X x Y) the set of all the intuitionistic fuzzy subsets in X x Y. Besides we know
that the complementary relation of R is

Rc -- {((x,y),VR(X,y),pR(x,y))](x,y) E X x Y}.

The most important properties of the intuitionistic fuzzy relations are studied in [4,6].
Besides, we know that the composition of intuitionistic fuzzy relations is given by

Definition 1. Let ~,fl, 2,p be t-norms or t-conorms not necessarily dual two-two, R E IFR(X x Y) and
P E IFR(Y x Z). We will call composed relation P~3/~RE IFR(X x Z) to the one defined by
2,p

p~ol~R
).,p
= { {(X,Z),/Jp,g,R (X,Z), Vp,/~R(X,Z)}Ix E X,z E Z},
t.iJ ~.p
 H. Bustince, P. BurillolFuzzy Sets and Systems 78 (1996) 293-303 295

where

p o~g~g(X,Z)= ~{~[pR(X, y), #p(y,z)]}

Ve,o~g(X,Z) = 2{p[vg(x, y), ve(y,z)]},

),t'

whenever

O~ltp~4,R(X,Z)-'[-Vp~4iR(X,Z)<<.I V(X,Z) E X × Z.
/4 J /4'

Notice that the symbols ~, fl which are in the higher place of "o" are applied to the functions of membership
and the symbols 2 and p which are in the lower place are applied to the non-membership functions. We have
proved in [6] that for ~ --- V, fl t-norm, 2 = A and p t-conorm, the composition of intuitionistic relations
satisfies the largest number of properties.
In this paper we will take ~ -- V, fl t-norm, 2 -- A and p t-conorm. As it can be seen there will be some
cases in which we will specify more about fl and p, taking fl = A and p -- V. Finally, just mention that fl*
will denote the dual t-conorrn of the t-norm ft.
The choice of the t-norms and t-conorms ~, fl, 2, p in the previous definition is evidently conditioned by the
fulfilment of

O~11p~R(X,Z ) Jr- Vp~4~R(X,Z)~ 1 V(X,Z) E X x Z.

z,p 2,p

In this direction:

Proposition I. In the conditions of the Definition 3, /f 2* and p* are, respectively, the dual forms of 2 and
p and :~<<.2", ~ <~p*, then
O<~P/gR(X,Z) + V/gR(X,Z)<~1 V(x,z) 6 X x Z.
/,i' 2,p

Now, we will remember the main properties of the intuitionistic fuzzy relations in a set, i.e. in X × X. A
complete study of these relations is made in [6].

Definition 2. We will say that R E IFR(X × X ) is:

(1) Reflexive, if for every x E X, pR(x,x) = 1. Just notice that for every x in X, vg(x,x) = O.
(2) Antireflexive, if for every x E X, then

t~g(x,x) = 0, vR(x,x) = 1,
that is to say, if its complementary Rc is reflexive.
(3) Symmetric, i f R = R -1, i.e. if for every (x,y) o f X x X

t~R(x, y) = #R(y,x), VR(X, y) = VR(y,x)

in the opposite way we will say that it is asymmetric.
(4) Antisymmetrical intuitionistic, if

(#R(X, y) 7~ pR(y,x),
V(x,y) C X x X, x ¢ y, then ~VR(X,y) ¢ VR(y,x),
[~R(x, y ) = ~R(y,x).
296 H. Bustince, P. Burillo / Fuzzy Sets and Systems 78 (1996) 293-303

(5) Perfect antisymmetrical intuitionistic, if for every (x, 3') E X x X with x ¢ y and

pR(x,y) > 0 or (pR(x,y)=OandVR(X,y) < 1),

then

ItR(y,x)=O and VR(y,x)= 1.

v#
(6) Transitive, if R>>-R~ R.
A,p
A,p
(7) C-transitive, if R<~R o R.
v,l¢

Notice that not only the sign of inequality changes in items (6) and (7), but also the order of V, /~, A
and p.
Notice that the definition of intuitionistic antisymmetry does not recover the fuzzy antisymmetry for the
case in which the relation R considered is fuzzy. This new definition is justified because:
The relation

x --<--RY if and only if ~~tR(y'x)<~I~R(x' Y),

[ ,~y,x) ,! VR(X,y)
is an order in the referential X if the intuitionistic fuzzy relation R E IFR(X × X ) is reflexive, transitive and
intuitionistic antisymmetrical fuzzy [6]. This fact does not take place if we take, instead of the intuitionistic
antisymmetrical previous property, the definition of antisymmetrical fuzzy property given by Kaufmann [7].
However, the definition of intuitionistic perfect antisymmetry does recover the definition of perfect fuzzy
antisymmetry given by Zadeh [8] when the considered relation is fuzzy.

Definition 3. Let R be an element of IFR(X × X). ~ t-conotm and p t-norm.

A
(1) We will call transitive closure of R, to the minimum intuitionistic fuzzy relation R on X x X which
contains R and it is transitive. Besides

: R v R AR VR AR AR v . . . v R,,
A,V A,V A,V

V
(2) We will call c-transitive closure of R to the biggest c-transitive relation R E IFR(X x X ) contained in
R. Besides
V AV AV AV
Rc = Rc ARc $ Rc A Rc 3 Rc $ Rc A • " " A R n.
V,A V,A V,A

We will start this paper by studying the relation that exists between the properties of a relation and the
properties of its complementary one. Next, we define the structures in the intuitionistic fuzzy relations, and
we also study their main properties. Besides, we analyse the relation between the structures of R and Re.
We conclude this paper with two theorems that characterize the structures of the intuitionistic fuzzy relations
according to the structures of the fuzzy relations Do(R) and DI(R).

2. Relation between an IFR and its complementary relation

Now we are going to study the composition of intuitionistic complementary fuzzy relations and its transitive
closures.
 H. Bustince, P. Burillo/Fuzzy Sets and Systems 78 (1996) 293-303 297

Theorem 1. Let R,P be two elements of lFR(X × X), fl a t-norm and p a t-conorm, it is verified that

= Re S Pc.
\ A,p /¢ v,~

Proof. As pRo(x,z) = vn(x,z) and vnc(x,z) = pn(x,z) for every (x,z) in X × X, we have

R~P= { ((x'z)' y{fl[#P(x'y)'PR(Y'Z)]}'

. A{p[vp(x'y)'vR(Y'Z)]})I(x'z)
y E X x X}

\ A,p L :{ A {p[vp(x,z), vR(x,z)]}, Vy {#[~p(x,z),~R(x,z)]}) = ~,~

Theorem 2. Let R be an intuitionistic fuzzy relation in (X x X ) and Re its complementary relation, fl = A

and p = V
V A
Rc = (R)c
holds.

Proof. We know that

R = {((x,y),#n(x,y),vg(x,y))[ (x,y) C X × X } ,
Rc = {((x,y),vR(x,y),pn(x,y))[ (x,y) C X x X } ,
A V A
calculating R and Re, we have R = R V R~AR V R~AR~AR V ... V R n, therefore
A,V A,V A,V

p^(x, y) = I~n(x, y) V #Rv6^n(x, y) V . . . V pR,,(x,y),

R
A,v

v~(x, y ) = vn(x, y ) A vRvo^le(x, y ) A . . . A vg,,(x, y ) ,

R
A,V

with

PR~AR(x' Y) = V {A[pn(X,Z), 121¢(Z,y)]},

z
A.v

VR~AR(X,Z)= A {v[vR(x,z), vR(z, y)]},

z
A.V

V A,V A V A,V
Rc = Rc ARc o Rc ARc 5 R¢ o Rc A •.. A R n, therefore
V,A V,A V,A

pv (x, y) = pg:(x, y ) A PRo %vg,(x' Y) A ... A t~le,~(x,y),

Re
V,A

vv (x,y) = vnc(x,y) V v %vRc(x,y) V ' ' ' V vn,~(x,y),

Rc Rc
V,A
298 H. Bustinee, P. Burillo/ Fuzzy Sets and Systems 78 (1996) 293-303

with

#ReAovR(x, y) = A{v[m~(x, z), #R~(z,y)]},

Z
v,A

v,% %~ e (x,y) = V{A[vR~(x,z),v,%(z,y)]}.

V,A

As #R~(x,z) = vR(x,z) and vR~(x,z) = #R(x,z), we have

# ~ %~ R(x, y) = A{v[#R~(x,z), #R~(z, y)]} = A{v[vR(x,z), vR(z, y)]} = v ~ (x, y),

z z R R
V,A A.V

v~ ~o~R (x, y) = V{A[uR~(x,

v R o ( z , y )zl,l } z = V{A[#R(x,z),m(z,y)]}~ = #R ~o~R(x, y),
V.A A.V

therefore

#~ (x,y) =/~R~(x, y) A PR~ A# R~(x'Y) A --. A #R~(x, y) = vA(x,y)

Rc R
VA

vv (x, y) = vR~(x, y ) V R, %vR (x' y ) V " " • V VR:!(x,y) =- #A(x,

V.A

that is,
v
Rc = {((x,y),#~ (x,y),vv (x,y))l(x, y) ~ X × Y}
c Rc

= {((x,y),vA(x,y),R~(x,.v)>l ( x , y ) E X × Y} = (R)c.
A
[]

The next theorem establishes the relation that exists between the properties of an intuitionistic fuzzy relation
and its complementary one.

Theorem 3. R ¢ IFR(X x X )
(i) R is reflexive if and only if" Rc is antireflexive,
(ii) R is symmetrical if and only if Re is symmetrical,
(iii) R is antisymmetrical intuitionistic if and only if Rc is antisymmetrieal intuitionistic, and
(iv) R is transitive if and only if Re is c-transitive.

Proof. It is enough to remember the definitions. []

3. Structures in IFR

In this secction we will have /~ = A and p = V.

Definition 4. A intuitionistic fuzzy relation R on the cartesian set (X x X), is called:

(1) an intuitionistic tolerance relation on X x X if R is reflexive and symmetric;
(2) an intuitionistic atolerance relation on X x X if R is symmetric and antireflexive;
(3) an intuitionistic preorder if it is reflexive and transitive;
(4) an intuitionistic order if it is reflexive, transitive and antisymmetricai intuitionistic;
(5) an intuitionistic perfect ordering if it is reflexive, transitive and perfect antisymmetrical intuitionistic;
 H. Bustince, P. Burillo/Fuzzy Sets and Systems 78 (1996) 293 303 299

(6) an intuitionistic strict order if R is antireflexive, transitive and antisymmetrical intuitionistic;

(7) an intuitionistic similarity relation on X x X if R is reflexive, symmetric and transitive; and
(8) an intuitionistic dissimilarity relation on X x X if R is symmetric, antireflexive and transitive.

We can build a definition similar to the previous one using c-transitive property, where the structures of
similarity, preorder, intuitionistic order, intuitionistic strict order, dissimilarity and intuitionistic perfect order
will have to fulfil the same properties that the ones given in the definition, but substituting the transitive
property for the c-transitive one. Whenever we use a structure respecting the c-transitive property, we will
specify it.
We know that [6], If R E IFR(X x X ) is reflexive, then
n-times
r

A,V A,V A,V

with n = 1,2 . . . . . it is reflexive. Besides

Theorem 4. Let R1 be a reflexive intuitionistic fuzzy relation in X x X. Then

(i) (Rl) -I is reflexive,
(ii) Ri V R2 is reflexive for every Re E IFR(X x X), and
(iii) Ri A Re is reflexive if and only if Re C IFR(X x X ) is reflexive.

Proof. Just notice that

]AR,VR2(X,X) = ]AR,(X,X ) V ]AR2(X,X ) = 1 V #R:(X,X) = 1,

v e , v R 2 ( x , x ) = v R , ( x , x ) /~ v R : ( x , x ) = 0 A VR2(X,X) = O,

p,%Ae:(x,x) = I~R,(x,x) A I2,%(x,x) = 1 A pnz(x,x) = I~R2(x,x),

VR, AR,(X,X) = V e , ( x , x ) v vR2(x,x) = 0 v vk~(x,x) = vR2(x,x). []

Corollary 1. I f RI,R2 E R I F ( X x X ) are intuitionistic tolerance relations, then so are Ri V R2, Ri A R2

A
and Rj.

Proof. It is enough to remember Theorem 4. E]

Theorem 5. Let R~,R2 be two elements of lFR(X × X), RI intuitionistic tolerance relation, R2 intuitionistic
A
similarity relation and R1 <~R2, then R1 <~R2.

Proof. Rl ~Rz E IFR(X × X), by means of the monotony of the composition of intuitionistic fuzzy relations
[6], R1V3AR1 <~R2, R1 ~/~RlVSARi ~R2 ..... as R1 is reflexive and symmetrical intuitionistic, by Theorem 4 and
A,V A,V A,V
[6], it is fulfilled that

R1 V RIVSAR1 V ... V Rn
A,V

is reflexive and symmetrical intuitionistic, therefore

A
R1 = R1V RjVSARI v . . . V RT <~R2 V ReVSAR2 V . . . V R'~ =R2. []
A,V A,V
300 H. Bustince, P. Burillo/Fuzzy Sets and Systems 78 (1996)293-303

A A V V
In the paper [6] is proof that if R , P C IFR(X x X ) and R<<.P, then R<~P and R<<.p. Besides, we know
v#
that [6] if R is reflexive and transitive, then R = R S R. Next theorem is proved with all this.
A,p

Theorem 6. In every intuitionistic preorder:

(i) R = RVsAR
A,V
(ii) R = R k Jor every k = 1,2 .... are verified.

The next theorem establishes the relation that exists between the structures of R E IFR(X × X ) and the
ones o f its complementary relation.

Theorem 7. Let R be an intuitionistic f u z z y relation on (X × X):

(i) R is an intuitionistic order if and only if Rc is an intuitionistic strict order respecting the c-transitive
property;
(ii) R is an intuitionistic tolerance relation if and only /fRc is an intuitionistic atolerance relation; and
V
(iii) R is an intuitionistic tolerance relation if and only if Rc is an intuitionistic dissimilarity relation
respectin9 the c-transitive property.

Proof. It is a direct consequence o f Theorem 3. []

Theorem 8. R E IFR(X x X ) is an intuitionistic similarity relation if and only if Rc is an intuitionistic

dissimilarity relation respecting the c-transitive property.

Proof. It is enough to remember the definition o f similarity and dissimilarity relations. []

4. Characterization of intuitionistic fuzzy structures

Next theorem gives necessary and sufficient conditions between the possible structures o f the intuitionistic
fuzzy relation R and the fuzzy relations associated to this by Atanassov's operators for p = 0 and p = 1,
v/~
(2). The composition that we consider for the following Theorems is R 8 R, being fl any t-norm and fl* its
dual t-conorm. A,#*
With that composition, let us remember that transitivity is defined as R>>.R V6#R and c-transitivity as
AffJr*
Aft*
R ~ R ~ R.
v,lJ

Theorem 9. Let R be an intuitionistic fuzz), relation in X x X.

(i) R is an intuition&tic preorder if and only if
(a) Do(R) is a f u z z y preorder and
(b) (Dl(R)) c is antireflexive and c-transitive.
(ii) R is an intuitionistic similarity relation if and only if
(a) Do(R) is a f u z z y similarity relation and
(b) (DI(R)) c is a f u z z y dissimilarity relation respectin9 the c-transitive.

Proof. In the proof we are going to use (1) and (2).

( 3 ) If R is reflexive, then #R(X,X) = 1 and VR(X,X) = 0 for all x E X therefore #zMR)(x,x) = #R(X,X) = 1
and lZ(D~tR))c(X,X)= VR(X,X)= 0 Vx C X, then Do(R) is reflexive and (Dl(R)) c is antirreflexive.
 H. Bustince, P. BurillolFuzzy Sets and Systems 78 (1996) 293-303 301

v#
If R is transitive, then R>~R S R, therefore
A,/~*

IJoo(R)(x, y) = #R(X, y) >1V {fl[#R(X,Z), #R(Z, y)]} = V {fl[#Do(R)(X,Z), ltDo(R)(Z,Y)]} = #Do(R)vj D0(R)(X,y)

and, therefore, Do(R) is transitive. As we have

.(o,(e)~(x, y)= ve(x, y) <.A{B*[vR(x.z), vR(z, y)]}

z
= A{flz ['U(D'(R))¢(X'Z)' 'tI(D'(R))¢(Z' y ) ] } ~-~ IA(D'(R))¢Ag*(D'(R))~ (X' y ) '

then (D I(R)) c is c-transitive.

If R is a symmetrical intuitionistic relation, then p R ( x , y ) = #R(y,x) and vR(x,y) = VR(y,x)V(x,y), there-
fore I~Oo(R)(x,y) =- #oo(R)(y,x) and #(O,(R))o(x, y) = I~(D,(R))c(y,x), then Do(R) and (DI(R)) c are symmetrical
relations.
(¢=) If Do(R) is a fuzzy preorder and (DI(R)) e is an antireflexive and c-transitive relation, we get
(i) Do(R) is a reflexive relation and (Dt(R))¢ is an antireflexive relation, then 1 = #Do(R)(X,X) and
VOo(R)(x,x) = 0 Vx E X, taking into account that #R(x,x) = #Do(R)(x,x) = 1 and VR(X,X) = #(D,(R))c(X,X ) ~-
0Vx E X then R is a reflexive relation.
(ii) As Do(R) is transitive fuzzy, then
v,fl
Do(R) >~Do( R )A~.Do( R ),

therefore

#Do(g)(X, y) >~V {fl[#Do(R)(X,Z ), #Do(8)(Z,y)]},

z
as #R(x, y ) = #Do(R)(X,Y) V(x, y ) E X x Y, we get

~R(x, y) 1>V{~[#R(x, z), ~R(z, y)]},

g

then

IJR(X,y)>/#R vj R(x,y) V(x,y) E X ×X.

A./~*

(Dr (R)) c is c-transitive, then

U(D,(R))~(x. y) ~ A{/~*[#(~, (R))o(x. z). #(0. (.))o(z, y)]},

z

as VR(x,y ) = I,I(D,(R))¢(x,y) V(x,y) 6 X × X, then

vR(x, y) <~A {fl*[vR(x,z), VR(z, y)]},
z
therefore, R is a transitive relation.
If Do(R) is a symmetrical relation, then V(x, y ) E X x X, #Do(R)(X,y ) = #Do(R)(y,x).
If (DI(R))¢ is a symmetrical relation, then p(D,(R))o(X,y ) = #(D.(R))c(Y,X), for every (x, y) in X × X.
Taking into account that for every (x, y ) E X x X

#R(x,y) -= ktDo(R)(X,y) and VR(X,y) = V(D,(R)),(x,y),

the result is that R is a symmetrical relation. []
302 H. Bustince, P. Burillo/Fuzzy Sets and Systems 78 (1996) 293-303

Theorem 10. ff'R b an intuitionistic order, then

(a) Do(R) is an order relath~n and
(b) (DI(R)) c b a strict order relation respecting the c-transitive property.

Proof. Reflexivity and transitivity are proved in the same way as in the previous theorem.
If R is antisymmetrical intuitionistic, then for every (x, y) E X × X with x ¢ y, we get
~R(x,y) ¢ ~R(y,x), vR(x,y) ¢ vR(y,x), foR(x, y) = ~R(y,x),
therefore,

IIDo(R)(X,Y) • ltDo(R)(y,x), It(D,(R))c(x,Y) 7L II(D,(R))~(y,x)

SO that Do(R) and (DI(R)) c are intuitionistic antisymmetrical relations. []

The reciprocal version of this theorem is not true because of the condition rcR(x,y) = rtR(y,x) of the
intuitionistic antisymmetry.

Corollary 2. Let R be an element of lFR(X × X )

(i) R is an intuitionistic preorder if and only if
(a) Do(R) is" a fuzzy preorder and
(b) DI(R) is a fitzzy preorder.
(ii) R is an intuitionistic similarity relation if and only if
(a) Do(R) is a juzzy similarity relation and
(b) DI(R) is a fuzzy similarity relation.

Proof. It is a consequence of Theorems 3 and 9. []

Corollary 3. I f R is an intuitionistic order, then

(a) Do(R) is a fuzzy order and
(b) DI(R) is a fuzzy order.

Proof. It is a consequence of Theorems 3 and 10. []

5. Remarks

The properties of the intuitionistic fuzzy relations presented in this paper show that the definition of these
properties does not always coincide with the definition of the properties of fuzzy relations. It happens that
there are properties like perfect intuitionistic antisymmetry that recover Zadeh's perfect antisymmetry for the
case fuzzy, while intuitionistic antisymmetry does not recover Kaufmann's antisymmetry for the fuzzy case.
On the other hand, Atanassov's operators (1) have allowed us to characterize the structure of intuitionistic
fuzzy relations in function with only two values of the index p, ( p = 0 and p = 1), (2). The study of the
characterization of the structures of intuitionistic fuzzy relations from fuzzy relations and from Atanassov's
operators (1) with any value of p can be found in [6].

Acknowledgements

I would like to thank the referees for the work they have done as well as Prof. Dr. H.-J. Zimmermann for
the interest shown.
 H. Bustince, P. Burillo / Fuzzy Sets and Systems 78 (1996) 293~03 303

References

[1] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems 20 (1986) 87-96.
[2] K. Atanassov, Review and new results on intuitionistic fuzzy sets, IM-MFAIS 1 (1988).
[3] K. Atanassov, Two operators on intuitionistic fuzzy sets, Comptes rendus de l'Acabmi bulgare des Sciences, Tome 41 (1988).
[4] T. Buhaescu, Some observations on intuitionistic fuzzy relations, ltinerat Seminar on Functional Equations, 1989, 111-118.
[5] P. Burillo and H. Bustince, Estructuras algebraicas en conjuntos 1FS, I1 Congreso Nacional de LSgica y Tecnologia Fuzzy, Boadilla
del Monte, Madrid, Spain, 1992, 135-147.
[6] H. Bustince, Conjuntos Intuicionistas e lntervalo valorados Difusos: Propieda- des y Construccirn, Relaciones lntuicionistas Fuzzy,
Thesis, Universidad Pfiblica de Navarra, 1994.
[7] A. Kaufmann, Introduction a la ThOorie des Sous-Ensembles Flous, Vols. l-IV (Masson, Paris, 1977).
[8] L.A. Zadeh, Similarity relations and fuzzy orderings, Inform. Sci. 3 (1971) 177-200.