Abstract
From the point of view of algebraic logic, this paper presents an algebraic analysis for binary intuitionistic lattice-valued fuzzy relations based on lattice implication algebras, which is a kind of lattice-valued propositional logical algebras. By defining suitable operations, we prove that the set of all binary intuitionistic lattice-valued fuzzy relations is a lattice-valued relation algebra, and some important properties are also obtained. This research shows that the algebraic description is advantageous to studying of structure of intuitionistic fuzzy relations.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
- Intuitionistic L-fuzzy relation
- L-fuzzy relation
- Lattice-valued relation algebra
- Lattice implication algebra
1 Introduction
Fuzzy relations, introduced by Zadeh [24] in 1965, permit the gradual assessment of relativity between objects, and this is described with the aid of a membership function valued in the real unit interval [0,1]. Later on, Goguen [9] generalized this concept in 1967 to lattice-valued fuzzy relation (L-fuzzy relation for short) for an arbitrary complete Brouwerian lattice \(L\) instead of the unit interval [0,1]. Intuitionistic fuzzy relation, defined by Atanassov in 1984 [1–3], is another kind of generalization for Zadeh’s fuzzy relation, give us the possibility to model hesitation and uncertainty by using an additional degree. An intuitionistic L-fuzzy relation (ILFR for short) \(R\) between two universes \(U\) and \(V\) is defined as an intuitionistic L-fuzzy set (ILFS) in \(U \times V\), assigns to each element \((x, y) \in U \times V\) a membership degree \(\mu _{R}(x, y) (\in L)\) and a non-membership degree \(\nu _{R}(x, y) (\in L)\) such that \(\mu _{R}(x, y) \,\leqslant\, N(\nu _{R}(x, y))\), where \(N: L \rightarrow L\) is an involutive order-reversing operation on the lattice \((L, \,\leqslant\, )\). When \(L = [0,1]\), the object \(R\) is an intuition fuzzy relation (IFR) and the following condition holds: \((\forall (x, y) \in U \times V) (0 \,\leqslant\, \mu _{R}(x, y) + \nu _{R}(x, y) \,\leqslant\, 1)\). For all \((x, y) \in U \times V\), the number \(\pi _{R}(x, y) = 1 - \mu _{R}(x, y) - \nu _{R}(x, y)\) is called the hesitation degree or the intuitionistic index of \((x, y)\) to \(R\). As we know, the structures and properties of operations on intuitionistic fuzzy relations have always been important topics in ILFS community. For that, P. Burillo and H. Bustince discussed the properties of several kinds of operations on ILFRs with different t-norms and t-conorms and characterized the structures of ILFRs in [4, 5]. In [6], G. Deschrijver and E. E. Kerre probed into the triangular compositions of ILFRs. In addition, the applications of ILFRs have also been developed rapidly in recent years, see [11, 13, 23].
As a fundamental conceptual and methodological tool in computer science just like logic, since the mid-1970s, relation algebras have been used intensively in applications of mathematics and computer science, and it also provides an apparatus for an algebraic analysis of ordinary predicate calculus, see e.g., [10, 18]. Following the idea of classical relation algebras, fuzzy relation algebras have been also considered by several researchers in [7, 8, 12]. Taking \(L\) to be a complete Heyting algebra, Furusawa developed the fuzzy relational calculus [7], and proved the representation theorems for algebraic formalizations of fuzzy relations in 1998. Furusawa’s fuzzy relations algebras are equipped with sup-min composition and a semiscalar multiplication. In [8], Furusawa continued to study Dedekind categories with a cutoff operator, in which the Dedekind formula holds. In [16, 17], Popescu established the notion of MV-relation algebra based on MV-algebras, investigated their basic properties, and given a characterization of the "natural" MV-relation algebras. In order to provide a kind of algebraic model for lattice-valued first-order logic, based on complete lattice implication algebras [22], Pan introduced the notion of lattice-valued fuzzy relation algebra [14]; its basic properties and cylindric filters have also been established. For other categorical description of fuzzy relations, we refer readers to [19–21].
Along the line of the algebraic formalization of fuzzy relations, the present paper aims at investigating the arithmetical properties of mathematical structures formed by binary ILFRs based on the theory of L-fuzzy relation algebras (LRA). The paper is organized as follows. We recall some fundamental notions and properties of lattice implication algebras, Intuitionistic L-fuzzy relations and LRA in Sect. 2.2. Section 2.3 devotes to arithmetical properties of ILFRs. We conclude the paper in Sect. 2.4 with some radical suggestions for further problems.
2 Preliminaries
In this section, we review some basic definitions about intuitionistic L-fuzzy relations, lattice implication algebras, and lattice-valued relation algebras for the purpose of reference and also recall some basic results which will be frequently used in the following, and we will not cite them every time they are used.
Definition 1
[22] A bounded lattice \((L,\vee ,\wedge ,O,I)\) with order-reversing involution \(^{\prime }\) and a binary operation \(\rightarrow \) is called a lattice implication algebra if it satisfies the following axioms:
- (\(I_{1}\)):
-
\(x \rightarrow (y \rightarrow z) = y \rightarrow (x \rightarrow z)\),
- (\(I_{2}\)):
-
\(x \rightarrow x = I \),
- (\(I_{3}\)):
-
\(x \rightarrow y = y^{\prime } \rightarrow x^{\prime } \),
- (\(I_{4}\)):
-
\(x \rightarrow y = y \rightarrow x =I \Rightarrow x = y \),
- (\(I_{5}\)):
-
\((x \rightarrow y) \rightarrow y =(y \rightarrow x)\rightarrow x ,\)
- (\(L_{1}\)):
-
\((x \vee y) \rightarrow z = (x \rightarrow z) \wedge (y \rightarrow z)\),
- (\(L_{2}\)):
-
\((x \wedge y) \rightarrow z = (x \rightarrow z) \vee (y \rightarrow z)\),
for all \( x,y,z \in L \).
Example 1
[22] Let \(L = [0,1]\). If for any \(a, b \in L\), put
Then, \((L, \vee , \wedge , \otimes , \rightarrow , ^{\prime })\) is called the Łukasiewicz algebra. Here, \(\rightarrow \) is called the Łukasiewicz implication, \(\otimes \) is called the Łukasiewicz product, and another operation \(\oplus \), \(a \oplus b = \text{min}\{1, a+b \}\), is called the Łukasiewicz sum. It is easy to show that \((L, \vee , \wedge , \rightarrow , ^{\prime }, 0, 1)\) is also a lattice implication algebra.
Theorem 1
[22] Let (\(L,\vee ,\wedge ,^{\prime },\rightarrow ,0,1\)) be a lattice implication algebra, then (\(L,\vee ,\wedge \)) is a distributive lattice.
In what follows, we list some well-known properties of lattice implication algebras that will often be used without mention. In a lattice implication algebra \(L\), we define binary operation \(\otimes \) and \(\oplus \) as follows: for any \(x, y \in L\), \(a \otimes b = (a \rightarrow b^{\prime })^{\prime }; \ \ a \oplus b = a^{\prime } \rightarrow b.\)
Proposition 1
Let \(L\) be a lattice implication algebra, then for any \(x, y, z \in L\), we have the following:
-
(1)
\(x \rightarrow y = I\) if and only if \(x \,\leqslant\, y\);
-
(2)
\(x \rightarrow y \geqslant x^{\prime } \vee y\);
-
(3)
\((x \otimes y)^{\prime } = x^{\prime } \oplus y^{\prime }, (x \oplus y)^{\prime } = x^{\prime } \otimes y^{\prime }\);
-
(4)
\(O \otimes x = O, I \otimes x = x , x \otimes x^{\prime } = O, O \oplus x = x, I \oplus x = I, x \oplus x^{\prime } = I;\)
-
(5)
\(x \otimes y = (x \vee y) \otimes (x \wedge y), x \oplus y = (x \vee y) \oplus (x \wedge y)\);
-
(6)
\(x \otimes (y \vee z) = (x \otimes y) \vee (x \otimes z), x \otimes (y \wedge z) = (x \otimes y) \wedge (x \otimes z)\).
In [14], by generalizing the classical (Boolean) relation algebras, we introduce the notion of lattice-valued relation algebra based on complete lattice implication algebras \(L\).
Definition 2
A lattice-valued relation algebra (LRA for short) is an algebra \({\mathfrak L} = (L, \vee , \wedge , ^{\prime }, \rightarrow , O, I, ;, \smile , \triangle )\), where
-
(1)
\((L, \vee , \wedge , ^{\prime }, \rightarrow , O, I)\) is a lattice implication algebra;
-
(2)
\((L, ;, \triangle )\) is a monoid (a semigroup with identity, \(\triangle \));
-
(3)
\((x \vee y) ; z = (x ; z) \vee (y ; z)\);
-
(4)
\((x \rightarrow y)^{\smile } = x^{\smile } \rightarrow y^{\smile }\);
-
(5)
\(x^{\smile \smile } = x\);
-
(6)
\(\triangle ^{\prime } \vee \triangle = I\);
-
(7)
\((x ; y)^{\smile } = y^{\smile } ; x^{\smile }\);
-
(8)
\(y^{\prime } = y^{\prime } \vee (x^{\smile } ; (x ; y)^{\prime })\);
-
(9)
\((a \otimes x) ; (b \otimes y) \,\leqslant\, (a ; b) \otimes (x ; y)\).
From the above definition, an LRA is an expansion of the corresponding lattice implication algebra with the operations \(\smile , ;, \triangle \), where \(\smile \) is called the converse operation and \(;\) the relative multiplication operation and \(\triangle \) the diagonal element. The class of LRAs will be denoted by \({\mathfrak{LRA}} \).
Let (\(L,\vee ,\wedge ,^{\prime },\rightarrow ,0,1\)) be a complete lattice implication algebra. An intuitionistic L-fuzzy relation \(R\) from a universe \(U\) to a universe \(V\) is an intuitionistic fuzzy set in \(U \times V\), i.e. an object having the form \(R = \{((x, y), \mu _{R}(x, y), \nu _{R}(x, y)) | x \in U, y \in V\}\), where \(\mu _{R}: U \times V \rightarrow L\) and \(\mu _{R}: U \times V \rightarrow L\) satisfy the condition \((\forall (x, y) \in U \times V) (\mu _{R}(x, y) \,\leqslant\, (\nu _{R}(x, y))^{\prime })\). The set of all intuitionistic L-fuzzy relations from \(U\) to \(V\) will be denoted by \({\mathfrak{ILFR}} (U \times V)\). We say the intuitionistic L-fuzzy relation \(R\) is contained in the intuitionistic L-fuzzy relation \(S\), written \(R \subseteq S\) if \(\mu _{R}(x, y) \,\leqslant\, \mu _{S}(x,y)\) and \(\nu _{R}(x, y) \geqslant \nu _{S}(x,y)\) for all \((x, y) \in U \times V\). The zero relation \(O_{U \times V}\) and the full relation \(I_{U \times V}\) are intuitionistic L-fuzzy relations with \(\mu _{O_{U \times V}}(x, y) = O\), \(\nu _{O_{U \times V}}(x, y) = I\) and \(\mu _{I_{U \times V}}(x, y) = I\), \(\nu _{I_{U \times V}}(x, y) = O\) for all \((x, y) \in U \times V\), respectively. It is trivial that \(\subseteq \) is a partial order on \({\mathfrak{ILFR}} (U \times V)\) and \(O_{U \times V} \subseteq R \subseteq I_{U \times V}\) for all intuitionistic L-fuzzy relations \(R\). The union, intersection complement, and converse of intuitionistic L-fuzzy relations are defined as follows:
It is easy to show that \(({\mathfrak{ILFR}} (U \times V), \cup , \cap , O_{U \times V}, I_{U \times V})\) is a complete lattice. Let \(R \in {\mathfrak{ILFR}} (U \times V)\) and \(S \in {\mathfrak{ILFR}} (V \times W)\), the relative multiplication (or composition) \(R ; S\) is defined as follows:
then \(\bigvee _{y \in V} \big (\mu _{R}(x, y) \otimes \mu _{S}(y, z)\big ) \,\leqslant\, \big (\bigwedge _{y \in V} \big (\nu _{R}(x, y) \oplus \nu _{S}(y, z)\big )^{\prime }\) for any \((x, z) \in U \times W\). Let \(R, S \in {\mathfrak{ILFR}} (U \times V)\), \(R \rightarrow S\) is also an intuitionistic L-fuzzy relation on \(U \times V\), where \(\mu _{R \rightarrow S}(x, y)\) means the truth degree of the sentence, if \(xRy\), then \(xSy\); and \(\nu _{R \rightarrow S}(x, y)\) means the truth degree of the sentence, if \(xRy\) does not hold, then \(xSy\) does not hold.
Throughout this paper, unless otherwise stated, \(L\) always denotes a complete lattice implication algebra. For more details of lattice implication algebras, we refer readers to [15, 22].
3 The Arithmetical Properties of \({\mathfrak{ILFR}} (U \times U)\)
In this section, we study the arithmetical properties of intuitionistic L-fuzzy relations on the universe \(U\).
Theorem 2
Let \(U\) be any non-empty set. The union, intersection, complement, converse, and composition of intuitionistic L-fuzzy relations in \(U\) are defined as that in Sect. 2.2. We also define the operations \(\rightarrow , \oplus , \otimes \) on \({\mathfrak{ILFR}} (U \times U)\), for any \(R, S \in {\mathfrak{ILFR}} (U \times U)\),
and define the identity relation \(\triangle _{U}\) is an intuitionistic L-fuzzy relation on \(U\) such that for any \((x, y) \in U \times U\),
Then, \(({\mathfrak{ILFR}} (U \times U), \cup , \cap , ^{\prime }, \rightarrow , O_{U}, I_{U}, ;, \smile , \triangle _{U})\) is an LRA.
Proof
The zero relation and the full relation on \(U\) are denoted by \(O_{U}\) and \(I_{U}\), respectively. As we have discussed above, \(({\mathfrak{ILFR}} (U \times U), \cup , \cap , O_{U}, I_{U})\) is a bounded lattice. For any \(R, S, T \in {\mathfrak{ILFR}} (U \times U)\), since
and \(\nu _{R \rightarrow (S \rightarrow T)}(x, y) = \nu _{S \rightarrow (R \rightarrow T)}(x, y)\) can also be proved similarly, \(I_{1}\) holds. In this way, we can validate \(I_{2}, \ldots , I_{5}\) and \(L_{1}, L_{2}\). Hence, \(({\mathfrak{ILFR}} (U \times U), \cup , \cap , ^{\prime }, \rightarrow , O_{U}, I_{U})\) is a lattice implication algebra. The associativity \((R ; S) ; T = R ; (S ; T)\) and the unitary law \(R ; \triangle _{U} = \triangle _{U} ; R = R\) and the zero law \(R ; O_{U} = O_{U} ; R = O_{U}\) are obvious. So far, we have proved \((1), (2)\) in definition 2. (4), (5), and (6) are obvious. The rest is to prove (3), (7), (8), and (9). Note that \(L\) is an infinite distributive lattice, hence,
\(\mu _{(R \cup S) ; T}(x, z) = \mu _{(R ; T) \cup (S ; T)}(x, z)\) is similar. Thus, (3) holds. In this way, we can obtain (7). In order to prove (8), we only need to prove \(R^{\smile } ; (R ; S)^{\prime } \,\leqslant\, S^{\prime }\), or \(\big (R^{\smile } ; (R ; S)^{\prime }\big )^{\prime } \geqslant S\). As
and for any \(z \in U\),
Similarly, we can prove \(\nu _{(R^{\smile } ; (R ; S)^{\prime })^{\prime }}(x, y) \,\leqslant\, \nu _{S}(x, y)\). Thus, (8) holds. For (9), we only validate the part of the degree of membership, the other part is similar.
Thus, (9) holds. To sum up, \(({\mathfrak{ILFR}} (U \times U), \cup , \cap , ^{\prime }, \rightarrow , O_{U}, I_{U}, ;, \smile , \triangle _{U})\) is an LRA.
Corollary 1
Let \(U\) be any non-empty set. For any \(R, S \in {\mathfrak{ILFR}} (U \times U)\) , the following identities are true:
-
(1)
\(I_{U}^{\smile } = I_{U}, \triangle _{U}^{\smile } = \triangle _{U}, O_{U}^{\smile } = O_{U}\);
-
(2)
\((R^{\prime })^{\smile } = (R^{\smile })^{\prime }\);
-
(3)
\((R \vee S)^{\smile } = R^{\smile } \vee S^{\smile }\), \((R \wedge S)^{\smile } = R^{\smile } \wedge S^{\smile }\);
-
(4)
\((R \oplus S)^{\smile } = R^{\smile } \oplus S^{\smile }\), \((R \otimes S)^{\smile } = R^{\smile } \otimes S^{\smile }\).
According to Definition 2, the following conclusions can be obtained. Here, we only prove (5); for more details, please refer to [14].
Proposition 2
Let \(U\) be any non-empty set. For any \(R, S, T \in {\mathfrak{ILFR}} (U \times U)\) , the following conclusions are true:
-
(1)
\(R ; (S \vee T) = (R ; S) \vee (R ; T)\);
-
(2)
\(S^{\prime } = S^{\prime } \vee ((S ; R^{\smile })^{\prime } ; R)\);
-
(3)
\(R ; S \,\leqslant\, T^{\prime } \Leftrightarrow R^{\smile } ; T \,\leqslant\, S^{\prime } \Leftrightarrow T ; S^{\smile } \,\leqslant\, R^{\prime }\);
-
(4)
\(R \,\leqslant\, I_{U} ; R ; I_{U}\), \(I_{U} = I_{U} ; I_{U}\);
-
(5)
\(R ; (S \oplus T) \,\leqslant\, (R ; S) \oplus (I_{U} ; T)\), \((R \oplus S) ; T \,\leqslant\, (R ; T) \oplus (S ; I_{U})\);
-
(6)
\(I_{U} ; (R \rightarrow S) ; I_{U} \,\leqslant\, (I_{U} ; R^{\prime } ; I_{U})^{\prime } \rightarrow (I_{U} ; S ; I_{U})\);
-
(7)
\((I_{U} ; R^{\prime } ; I_{U})^{\prime } \,\leqslant\, I_{U} ; R ; I_{U}\);
-
(8)
\(R^{\smile } \,\leqslant\, S^{\smile }\) if and only if \(R \,\leqslant\, S\).
Proof
(5) We only prove the first inequality, the second can be proved similarly. Since
and note that \(R^{\smile } ; (R ; S)^{\prime } \,\leqslant\, S^{\prime }\) and \(I_{U} ; (I_{U} ; T)^{\prime } = I_{U}^{\smile } ; (I_{U} ; T)^{\prime } \,\leqslant\, T^{\prime }\), thus
this is equivalent to \(R^{\smile } ; (S \oplus T) \,\leqslant\, \big ((R ; S)^{\prime } \otimes (I_{U} ; T)^{\prime }\big )^{\prime } = (R ; S) \oplus (I_{U} ; T)\).
Corollary 2
Let \(U\) be any non-empty set. For any \(R, S \in {\mathfrak{ILFR}} (U \times U)\) , then,
-
(1)
\(R = R^{\smile }\) , or \(R\) and \(R^{\smile }\) are incomparable, in notation, \(R \Vert R^{\smile }\);
-
(2)
if \(S \,\leqslant\, \triangle _{U}\) , then \(R \geqslant R ; S\) and \(R \geqslant S ; R\) ; if \(S \geqslant \triangle _{U}\) , then \(R \,\leqslant\, R ; S\) and \(R \,\leqslant\, S ; R\).
In the following, for any \(R, S \in {\mathfrak{ILFR}} (U \times U)\) , we let \(\square_{U} = \triangle _{U}^{\prime }, \ R \dag S = (R^{\prime } ; S^{\prime })^{\prime }\) , where \(\square_{U}\) is called the diversity element in \({\mathfrak{ILFR}} (U \times U)\), \(\dag \) is called relative addition. By Theorem 2, Corollary 1, and Proposition 2, the following conclusions can be obtained, the proofs are omitted.
Proposition 3
Let \(U\) be any non-empty set. For any \(R, S, T \in {\mathfrak{ILFR}} (U \times U)\) , then,
-
(1)
\(R \dag (S \dag T) = (R \dag S) \dag T\);
-
(2)
\((R \dag S)^{\smile } = S^{\smile } \dag R^{\smile }\);
-
(3)
\(R^{\smile } ; (R^{\prime } \dag S) \,\leqslant\, S\);
-
(4)
\(\square _{U}^{\smile } = \square _{U}\);
-
(5)
\(R \dag (S \wedge T) = (R \dag S) \wedge (R \dag T)\), \((R \wedge S) \dag T = (R \dag T) \wedge (S \dag T)\);
-
(6)
\(R ; (S \dag T) \,\leqslant\, (R ; S) \dag T\);
-
(7)
\((R \dag S) ; T \,\leqslant\, R \dag (S ; T)\);
-
(8)
\(\triangle _{U} \,\leqslant\, R \dag (R^{\prime })^{\smile }\), \(R ; (R^{\prime })^{\smile } \,\leqslant\, \square _{U}\);
-
(9)
\(\triangle _{U} \,\leqslant\, R \dag S\) if and only if \(\triangle _{U} \,\leqslant\, S \dag R\) if and only if \(\triangle _{U} \,\leqslant\, R^{\smile } \dag S^{\smile } \) if and only if \(\triangle _{U} \,\leqslant\, S^{\smile } \dag R^{\smile }\);
-
(10)
\(R \dag \square _{U} = \square _{U} \dag R = R, \ R \dag I_{U} = I_{U} \dag R = I_{U}\);
Theorem 3
Let \(U\) be any non-empty set and \(R, S, P \in {\mathfrak{ILFR}}(U \times U)\) . Then, \((S^{\smile } ; R^{\prime })^{\prime } = \bigvee _{S ; T \,\leqslant\, R}T.\) In particular, \(P^{\smile } = \bigvee _{P^{\prime } ; T \,\leqslant\, \square _{U}}T\).
Proof
For the first equality, on the one hand, by Definition 2, we have \(S ; (S^{\smile } ; R^{\prime })^{\prime } \,\leqslant\, R\); on the other hand, if \(S ; T \,\leqslant\, R\), by Proposition 2, this is equivalent to \(S^{\smile } ; R^{\prime } \,\leqslant\, T^{\prime }\), that is \(T \,\leqslant\, (S^{\smile } ; R^{\prime })^{\prime }\). Hence, \((S^{\smile } ; R^{\prime })^{\prime } = \bigvee _{S ; T \,\leqslant\, R}T\). Let \(S = P^{\prime }, R = \square _{U}\), we can obtain the second equality.
In what follows, we prove the main properties of the ILFRs using the calculus of the algebraic theory. Let \(R \in {\mathfrak{ILFR}} (U \times U)\). We say that \(R\) is reflexive if \(R \geqslant \triangle _{U}\), antireflexive if \(R \,\leqslant\, \square _{U}\), symmetrical if \(R = R^{\smile }\), and transitive if \(R \geqslant R ; R\).
Theorem 4
Let \(U\) be any non-empty set and \(R, S \in {\mathfrak{ILFR}} (U \times U).\) Then,
-
(1)
\(R\) is reflexive if and only if \(R^{\prime }\) is antireflexive;
-
(2)
\(R\) is symmetrical if and only if \(R^{\prime }\) is symmetrical;
-
(3)
\(R\) is transitive if and only if \(R^{\smile }\) is transitive.
Proof
-
(1)
\(R\) is reflexive if and only if \(R\,\geqslant \,\triangle _{U}\) if and only if \(R^{\prime } \,\leqslant\, (\triangle _{U}) = \square _{U}\) if and only if \(R^{\prime }\) is antireflexive.
-
(2)
By Corollary III.1 (2), we have \((R^{\prime })^{\smile } = (R^{\smile })^{\prime }\), so \(R\) is symmetrical if and only if \(R = R^{\smile }\) if and only if \(R^{\prime } = (R^{\smile })^{\prime } = (R^{\prime })^{\smile }\) if and only if \(R^{\prime }\) is symmetrical.
-
(3)
If \(R\) is transitive, then \(R \,\geqslant\, R ; R\), by Proposition III.1(8), we have \(R^{\smile } \,\geqslant \,(R ; R)^{\smile } = R^{\smile } ; R^{\smile }\); hence, \(R^{\smile }\) is transitive, and vice versa.
Corollary 3
Let \(U\) be any non-empty set and \(R \in {\mathfrak{ILFR}}(U \times U).\) The following conclusions hold:
-
(1)
if \(R\) is reflexive, then so are \(R ; R\) and \(R^{\smile }\);
-
(2)
if \(R\) is symmetrical, then so are \(R ; R\) and \(R^{\smile }\);
-
(3)
if \(R\) is transitive, then so are \(R ; R\) and \(R^{\smile }\);
-
(4)
if \(R\) is antireflexive, then \(R\,\geqslant\, R \dag R\).
4 Conclusion
In this paper, we present an algebraic analysis for binary intuitionistic lattice-valued fuzzy relations based on lattice implication algebras. For the theory and application of intuitionistic L-fuzzy relations, the algebraic description shows its advantages. More importantly, by the algebraization of the set of intuitionistic L-fuzzy relations, we can obtain a denotational semantics of intuitionistic L-fuzzy theory and hence a mathematical theory to reason about notions like correctness. Consequently, one may prove such properties using the calculus of the algebraic theory, the results, and methods of applications of fuzzy theory may be described by simple terms in this language.
References
Atanassov K, Stoeva S (1984) Intuitionistic L-fuzzy sets. In: Trappl R (ed) Cybernetics and Systems Research 2. Elsevier, Amsterdam, pp 539–540
Atanassov K (1984) Intuitionistic fuzzy relations. In: Antonov L (ed) Proceedings of the Third international symposium on automation and scientific instrumentation. Varna, vol II:56–57
Atanassov K (1986) Intuitionistic fuzzy sets. Fuzzy Sets Syst 20:87–96
Burillo P, Bustince H (1995) Intuitionistic fuzzy relations (Part I). Mathware Soft Comput 2:5–38
Burillo P, Bustince H (1995) Intuitionistic fuzzy relations (Part II). Mathware Soft Comput 2:117–148
Deschrijver G, Kerre EE (2003) On the composition of intuitionistic fuzzy relations. Fuzzy Sets Syst 136:333–361
Furusawa H (1998) Algebraic Formalisations of Fuzzy Relations and their Representation Theorems. Kyushu University, PhD-Thesis
Furusawa H, Kawahara Y, Winter M (2011) Dedekind Categories with cutoff operators. Fuzzy Sets Syst 173:1–24
Goguen JA (1967) L-fuzzy sets. J Math Anal Appl 18:145–157
Halmos P, Givant SR (1998) Logic as algebra. The Mathematical Association of America, Washington, D.C.
Hwang CM, Yang MS, Hung WL et al (2012) A similarity measure of intuitionistic fuzzy sets based on the Sugeno integral with its application to pattern recognition. Inf Sci 189:93–109
Kawahara Y, Furusawa H (1999) An algebraic formalization of fuzzy relations. Fuzzy Sets Syst 101:125–135
Li DF (2005) Multiattribute decision making models and methods using intuitionistic fuzzy sets. J Comput Syst Sci 70:73–85
Pan XD, Xu Y (2013) On the algebraic structure of binary lattice-valued fuzzy relations. Soft Computing 17:411–420
Pan XD, Xu Y (2010) Semantic theory of finite lattice-valued propositional logic. sci china. Inf Sci 53:2022–2031
Popescu A (2005) Many-valued relation algebras. Algebra Univers 53:73–108
Popescu A (2007) Some algebraic theory for many-valued relation algebras. Algebra Univers 56:211–235
Tarski A (1941) On the calculus of relations. J Symbolic Logic 6:73–89
Winter M (2001) A new algebraic approach to L-fuzzy relations convenient to study crispness. Inf Sci 139:233–252
Winter M (2003) Representation Theory of Goguen Categories. Fuzzy Sets Syst 1:339–357
Winter M (2003) Goguen categories. J Relat Methods Comput Sci 138:85–126
Xu Y, Ruan D, Qin KY, Liu J (2003) Lattice-valued logic-an alternative approach to treat fuzziness and incomparability. Springer, Berlin
Xu ZS, Yager RR (2006) Some geometric aggregation operators based on intuitionistic fuzzy sets. Int J Gen Syst 35:417–433
Zadeh LA (1965) Fuzzy sets. Inf. Control 8:338–353
Acknowledgments
The work was partially supported by the National Natural Science Foundation of China (Grant No. 61100046, 61175055) and the application fundamental research plan project of Sichuan Province (Grant No. 2011JY0092), and the Fundamental Research Funds for the Central Universities (Grant No. SWJTU12CX054, SWJTU12ZT14).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pan, X., Xu, P. (2014). An Algebraic Analysis for Binary Intuitionistic L-Fuzzy Relations. In: Sun, F., Li, T., Li, H. (eds) Foundations and Applications of Intelligent Systems. Advances in Intelligent Systems and Computing, vol 213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37829-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-37829-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37828-7
Online ISBN: 978-3-642-37829-4
eBook Packages: EngineeringEngineering (R0)