Next Article in Journal
DDC Control Techniques for Three-Phase BLDC Motor Position Control
Previous Article in Journal
A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem
Previous Article in Special Issue
Comparative Study of Type-2 Fuzzy Particle Swarm, Bee Colony and Bat Algorithms in Optimization of Fuzzy Controllers
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Type-1 Fuzzy Sets and Intuitionistic Fuzzy Sets †

1
Department of Bioinformatics and Mathematical Modelling, Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl. 105, Sofia 1113, Bulgaria
2
Intelligent Systems Laboratory, Prof. Asen Zlatarov University, Bourgas 8010, Bulgaria
In memory of Prof. Lotfi Zadeh (1921–2017).
Algorithms 2017, 10(3), 106; https://doi.org/10.3390/a10030106
Submission received: 3 July 2017 / Revised: 18 August 2017 / Accepted: 31 August 2017 / Published: 13 September 2017
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)

Abstract

:
A comparison between type-1 fuzzy sets (T1FSs) and intuitionistic fuzzy sets (IFSs) is made. The operators defined over IFSs that do not have analogues in T1FSs are shown, and such analogues are introduced whenever possible.

1. Introduction

In 1965, Lotfi Zadeh introduced the concept of fuzzy sets [1]. They are now one of the most serious and prospective directions for the development of Georg Cantor’s set theory. In spite of the concerns and critical remarks against fuzzy sets voiced by some of the most prominent specialists in the area of mathematical logic in the second half of the 1960s, fuzzy sets have been firmly established as a fruitful area of research, as well as of a tool for the evaluation of different objects and processes in nature and society. Soon after their launch, fuzzy sets became an object of extensions by themselves. Chronologically, the first of these extensions, L-fuzzy sets, were introduced by Goguen in 1969 [2]. The second extension was from Zadeh [3], who introduced the idea of interval-valued fuzzy sets. The third extension is the rough sets, which were defined by Z. Pawlak in 1981 [4,5]. The fourth was intuitionistic fuzzy sets (IFSs), introduced in 1983 [6]. In recent years, many other extensions of fuzzy sets have been proposed. It is now clear that a significant part of these are trivial modifications of other existing fuzzy set extensions which have been “re-branded” under new names.
In recent years, some authors have introduced the term “type-1 fuzzy set” (T1FS) as a synonym of Zadeh’s fuzzy set (e.g., [7,8,9]), emphasizing that T1FSs are the basis of the fuzzy sets extensions. Preserving this name, in the present paper, we discuss what is common and what is different between T1FSs and IFSs.
In Section 2 , we discuss the basic concepts in IFS theory that do not have analogues in T1FS theory and the reasons for this. In Section 3, we discuss the possibility for the transformation of some concepts from IFSs theory to T1FSs theory. So, we show some new directions for development of T1FS theory. The author is not aware of similar research.
The author would like to mention that his first research in the area of IFS was based on A. Kaufmann’s book [10], whose Russian translation was the first book on fuzzy sets that appeared in Bulgaria in the early 1980s. For this reason, the theory of IFSs uses the notation of [10].

2. What Is There in IFS Theory That Has No Analogue in T1FS Theory?

Below, following [11,12], we give the definitions of the basic concepts and the basic operations, relations, and operators over IFSs, and discuss which of them do and which do not have analogues in T1FS theory.
Let us have a fixed universe E and its subset A. The set
A * = { x , μ A ( x ) , ν A ( x ) | x E } ,
where
0 μ A ( x ) + ν A ( x ) 1
is called IFS and functions μ A : E [ 0 , 1 ] and ν A : E [ 0 , 1 ] represent the degree of membership (validity, etc.) and non-membership (non-validity, etc.), respectively. In IFSs, we can also define the function π A : E [ 0 , 1 ] by
π ( x ) = 1 μ ( x ) ν ( x ) ,
which corresponds to the degree of indeterminacy (uncertainty, etc.).
For brevity, we shall write below A instead of A * , whenever possible.
Obviously, for every T1FS A: π A ( x ) = 0 for each x E , and this set has the form { x , μ A ( x ) , 1 μ A ( x ) | x E } .
By analogy with the T1FSs, IFSs have the following geometrical interpretation (see Figure 1 and Figure 2).
In the T1FS-case, in both figures, the line for ν is missing and they coincide.
The IFSs have another geometrical interpretation (see Figure 3) that analogously can be transformed to the T1FS-case with omission of the line for ν . It is the first geometrical interpretation in circle.
The most practically useful geometrical interpretation of the IFSs (see Figure 4) makes no sense for T1FS, since the elements of such a set are only points projected onto the hypotenuse of the intuitionistic fuzzy interpretation triangle.
The situation with the next geometrical interpretation of the IFSs is similar (see Figure 5, Figure 6, Figure 7 and Figure 8). The interpretation in Figure 7 was introduced by Danchev in [13], while Szmidt and Kacprzyk constructed the three-dimensional geometrical interpretation in Figure 8 in [14,15,16].
In [17], the latest geometrical interpretation is introduced (see Figure 9), where p E . In it, the horizontal section and the two vertical sections have length of 1. The section determines the two boundary points that have ordinates with lengths ν ( p ) and μ ( p ) .
In this new interpretation, the central point—marked in Figure 10 by • with coordinates 1 2 , 1 2 —plays an important role. When a section passes through it, then this section corresponds to a T1FS-element (i.e., one, for which π ( p ) = 0 ).
It is clear that the basic IFS-operations and relations can be transformed (reduced) to T1FS-operations. Such operations are, e.g.,
A B iff ( x E ) ( ( μ A ( x ) μ B ( x ) & ν A ( x ) > ν B ( x ) ) ( μ A ( x ) < μ B ( x ) & ν A ( x ) ν B ( x ) ) ( μ A ( x ) < μ B ( x ) & ν A ( x ) > ν B ( x ) ) ) ;
A B iff ( x E ) ( μ A ( x ) μ B ( x ) & ν A ( x ) ν B ( x ) ) ; A = B iff ( x E ) ( μ A ( x ) = μ B ( x ) & ν A ( x ) = ν B ( x ) ) ; ¬ A = { x , ν A ( x ) , μ A ( x ) | x E } ; A B = { x , min ( μ A ( x ) , μ B ( x ) ) , max ( ν A ( x ) , ν B ( x ) ) | x E } ; A B = { x , max ( μ A ( x ) , μ B ( x ) ) , min ( ν A ( x ) , ν B ( x ) ) | x E } ; A + B = { x , μ A ( x ) + μ B ( x ) μ A ( x ) × μ B ( x ) , ν A ( x ) × ν B ( x ) x E } ; A × B = { x , μ A ( x ) × μ B ( x ) , ν A ( x ) + ν B ( x ) ν A ( x ) × ν B ( x ) x E } ; A @ B = { x , μ A ( x ) + μ B ( x ) 2 , ν A ( x ) + ν B ( x ) 2 | x E } ; A B = { x , max ( ν A ( x ) , μ B ( x ) ) , min ( μ A ( x ) , ν B ( x ) ) | x E } ,
defined for every two IFSs A and B (see [11,12]). The author was is only not aware of an operation over T1FS analogous of operation @ with the form
A @ B = { x , μ A ( x ) + μ B ( x ) 2 | x E } ,
where A and B are T1FSs.
Now, in [12,18], 53 different operations of intuitionistic fuzzy negation and 185 different operations of intuitionistic fuzzy implications are described. New 4 implications are given in [19,20,21,22]. The above implication is one of them. It has a T1FS-analogue, while approximately all the rest do not, but an analogy can be made with the above-mentioned operation @. The situation with the intuitionistic fuzzy negations is similar.
In IFS theory, there are some other operations that we do not discuss here because (at least at the moment) they do not have any practical application.
Now, there are four groups of operators, defined over IFSs. Below, we will shortly describe them and will discuss the possibility for them to obtain T1FS-forms.
As I wrote in [11,12], my research in IFSs started in February 1983 as a mathematical game, in which I transformed T1FS-operations to the above-described form of A * . However, only when I found analogues of the two standard modal operators for the new type of sets did I understand that these sets are essentially different from the already existing T1FSs. George Gargov (1947–1996) invited me to call the new object an “intuitionistic fuzzy set”, because of its correspondence to Brouwer’s idea for intuitionism (see [23,24]). The first two modal operators over IFS A have the form
A = { x , μ A ( x ) , 1 μ A ( x ) | x E } ,
A = { x , 1 ν A ( x ) , ν A ( x ) | x E } .
When the second geometrical interpretation (Figure 4) was constructed, it became clear why these two operators lose their sense if we try to define them over T1FS. This is so, because for each IFS A:
A A A .
while, if A is a T1FS
A = A = A .
Over the years, the two operators □ and ◊ have been the object of a series of extensions, some of which are mentioned below (see [12]):
D α ( A ) = { x , μ A ( x ) + α × π A ( x ) , ν A ( x ) + ( 1 α ) × π A ( x ) | x E } , F α , β ( A ) = { x , μ A ( x ) + α × π A ( x ) , ν A ( x ) + β × π A ( x ) | x E } , where   α + β 1 G α , β ( A ) = { x , α × μ A ( x ) , β × ν A ( x ) | x E } , H α , β ( A ) = { x , α × μ A ( x ) , ν A ( x ) + β × π A ( x ) | x E } , H α , β * ( A ) = { x , α × μ A ( x ) , ν A ( x ) + β × ( 1 α × μ A ( x ) ν A ( x ) ) | x E } , J α , β ( A ) = { x , μ A ( x ) + α × π A ( x ) , β × ν A ( x ) | x E } , J α , β * ( A ) = { x , μ A ( x ) + α × ( 1 μ A ( x ) β × ν A ( x ) ) , β × ν A ( x ) | x E } ,
where α , β [ 0 , 1 ] are fixed numbers.
Obviously, operator D α is an extension of the standard modal operators □ and ◊, because for each IFS A:
A = D 0 ( A ) , A = D 1 ( A ) .
Operator F α , β is an extension of the operator D α , because for each IFS A:
D α ( A ) = F α , 1 α ( A ) .
The rest of the operators do not have analogues in modal logic. Operators D α , F α , β , . . . are extensions of the operators □ and ◊, but they are objects of further extensions, described in [12].
It is important to mention that if α + β < 1 , then for each fuzzy set A and for each x E :
μ A ( x ) + α × π A ( x ) + ν A ( x ) + β × π A ( x ) = μ A ( x ) + ν A ( x ) + ( α + β ) × π A ( x )
< μ A ( x ) + ν A ( x ) + π A ( x ) = 1 .
Therefore, F α × β ( A ) is not a fuzzy set. Hence, operator F α × β cannot be applied over A without changing its status (from fuzzy set to IFS).
The situation with the other extended modal operators is similar.
The second group of modal operators can obtain T1FS-interpretation. They are defined sequentially, so each of the following operators is an extension of the previous ones. These operators are defined for each IFS A by:
A = { x , μ A ( x ) 2 , ν A ( x ) + 1 2 | x E } ,
A = { x , μ A ( x ) + 1 2 , ν A ( x ) 2 | x E } ;
α A = { x , α × μ A ( x ) , α × ν A ( x ) + 1 α | x E } ,
α A = { x , α × μ A ( x ) + 1 α , α × ν A ( x ) | x E } ,
where α [ 0 , 1 ] ;
α , β A = { x , α × μ A ( x ) , α × ν A ( x ) + β | x E } ,
α , β A = { x , α × μ A ( x ) + β , α × ν A ( x ) | x E } ,
where α , β , α + β [ 0 , 1 ] .
α , β , γ A = { x , α × μ A ( x ) , β × ν A ( x ) + γ | x E } ,
α , β , γ A = { x , α × μ A ( x ) + γ , β × ν A ( x ) | x E } ,
where α , β , γ [ 0 , 1 ] and max ( α , β ) + γ 1 ;
α , β , γ , δ A = { x , α × μ A ( x ) + γ , β × ν A ( x ) + δ | x E } ,
where α , β , γ , δ [ 0 , 1 ] and max ( α , β ) + γ + δ 1 .
α , β , γ , δ , ϵ , ζ A = { x , α × μ A ( x ) ϵ × ν A ( x ) + γ ,
β × ν A ( x ) ζ × μ A ( x ) + δ | x E } ,
where α , β , γ , δ , ϵ , ζ [ 0 , 1 ] and
max ( α ζ , β ϵ ) + γ + δ 1 ,
min ( α ζ , β ϵ ) + γ + δ 0
(see [12]).
In the next section, we discuss the modification of these operators for the T1FS-case.
The rest two groups of modal operators (see [25,26]) cannot be transformed for the T1FS-case, and will not be a subject of discussion here.
The basic intuitionistic fuzzy level operators (e.g., [12]) are:
P α , β ( A ) = { x , max ( α , μ A ( x ) ) , min ( β , ν A ( x ) ) | x E } , Q α , β ( A ) = { x , min ( α , μ A ( x ) ) , max ( β , ν A ( x ) ) | x E } ,
for α , β [ 0 , 1 ] and α + β 1 .
The degrees of membership and non-membership of the elements of a given universe to its subset can be directly changed by these operators. These operators are a standard extension of the existing operators in T1FS theory.
Following [12], we introduce two operators that are analogous to the topological operators of closure and interior (e.g., [27,28]). They were defined in October 1983 by the author, and their basic properties were studied. Three years later, the relations between the modal and the topological operators over IFSs were studied (see [11]). These operators are defined for every IFS A by:
C ( A ) = { x , sup y E μ A ( y ) , inf y E ν A ( y ) | x E } ,
I ( A ) = { x , inf y E μ A ( y ) , sup y E ν A ( y ) | x E } .
Since the beginning of the new century, these operators have been the objects of certain extensions. Six of these extensions are as follows (see [12]):
C μ ( A ) = { x , sup y E μ A ( y ) , min ( 1 sup y E μ A ( y ) , ν A ( x ) ) | x E } ,
C ν ( A ) = { x , μ A ( x ) , inf y E ν A ( y ) | x E } ,
I μ ( A ) = { x , inf y E μ A ( y ) , ν A ( x ) | x E } ,
I ν ( A ) = { x , min ( 1 sup y E ν A ( y ) , μ A ( x ) ) , sup y E ν A ( y ) | x E } ,
C μ * ( A ) = { x , min ( sup y E μ A ( y ) , 1 ν A ( x ) ) , min ( 1 sup y E μ A ( y ) , ν A ( x ) ) | x E } ,
I ν * ( A ) = { x , min ( 1 sup y E ν A ( y ) , μ A ( x ) ) , min ( sup y E ν A ( y ) , 1 μ A ( x ) ) | x E } .
IFSs are extended in some directions (e.g., [11]): intuitionistic L-fuzzy sets, interval-valued IFSs, IFSs over different universes, temporal IFSs, multidimensional IFSs, IFSs of n-type. Now, 30 years after the introduction of this last extension, some authors have incorrectly re-branded them as “Pythagorean fuzzy sets”, repeating the results from [29].
While the intuitionistic L-fuzzy sets are a direct extension of L-fuzzy sets [2] and the interval-valued IFSs are an extension of interval-values fuzzy sets [30], the rest extensions are the original ones (i.e., having no fuzzy sets analogues). Moreover, they cannot be transformed to T1FS-forms. For example, the IFSs of n-type have the form
A = { x , μ A ( x ) , ν A ( x ) | x E } ,
where
0 μ A ( x ) n + ν A ( x ) n 1 .
In the T1FS-case, the above inequality is transformed to 0 μ A ( x ) n 1 , which is equivalent to 0 μ A ( x ) 1 when n > 0 .

3. What in IFS Theory Can Be Transformed to T1FS Theory?

As we mentioned in Section 2, the first IFS-interpretation (Figure 1 and Figure 2) is a direct extension of T1FS-interpretation, while the interpretations from Figure 3 can be transformed to the T1FS-case. The next interpretations from Figure 4, Figure 5, Figure 6, Figure 7 and Figure 8 cannot be used in the T1FS-case, while the latest interpretations (from Figure 9) can be used in the T1FS theory. It will have the form from Figure 11.
As we mentioned above, IFS-operations can be transformed to T1FS-operations, but many of them will coincide. For example, if we transform the two IFS-implications, defined for two IFSs A and B:
A 3 B = { x , 1 ( 1 μ B ( x ) ) × s g ( μ A ( x ) μ B ( x ) ) ,
ν B ( x ) × s g ( μ A ( x ) μ B ( x ) ) | x E }
and
A 11 B = { x , 1 ( 1 μ B ( x ) ) × s g ( μ A ( x ) μ B ( x ) ) ,
ν B ( x ) × s g ( μ A ( x ) μ B ( x ) ) × s g ( ν B ( x ) ν A ( x ) ) | x E }
to T1FS-forms (i.e., when A and B are T1FSs), both sets ( A 3 B and A 11 B ) will coincide, obtaining the form
A B = { x , 1 ( 1 μ B ( x ) ) × sg ( μ A ( x ) μ B ( x ) ) | x E } .
The same is the situation with the IFS-negations. For example, if we transform the three IFS-negations for the IFS A
¬ 1 A = { x , ν A ( x ) , μ A ( x ) | x E } ,
¬ 3 A = { x , ν A ( x ) , μ A ( x ) × ν A ( x ) + μ A ( x ) 2 | x E } ,
¬ 4 A = { x , ν A ( x ) , 1 ν A ( x ) | x E }
to T1FS-forms (i.e., for a T1FS A), they will coincide, obtaining the form
¬ A = { x , ν A ( x ) | x E } = { x , 1 μ A ( x ) | x E } .
Obviously, the modal operators from the first group ( , , D α , . . . ) make no sense in the T1FS-case, while some of the operators from the second group can obtain T1FS-forms. Now, they will obtain the following forms:
A = { x , μ A ( x ) 2 | x E } ,
A = { x , μ A ( x ) + 1 2 | x E } ;
α A = { x , α × μ A ( x ) | x E } ,
α A = { x , α × μ A ( x ) + 1 α | x E } ,
where α [ 0 , 1 ] ;
α , β A = { x , α × μ A ( x ) | x E } ,
α , β A = { x , α × μ A ( x ) + β | x E } ,
where α , β , α + β [ 0 , 1 ] .
α , β , γ A = { x , α × μ A ( x ) | x E } ,
α , β , γ A = { x , α × μ A ( x ) + γ | x E } ,
where α , β , γ [ 0 , 1 ] and max ( α , β ) + γ 1 ;
α , β , γ , δ A = { x , α × μ A ( x ) + γ | x E } ,
where α , β , γ , δ [ 0 , 1 ] and max ( α , β ) + γ + δ 1 .
α , β , γ , δ , ϵ , ζ A = { x , α × μ A ( x ) ϵ × ν A ( x ) + γ | x E } ,
where α , β , γ , δ , ϵ , ζ [ 0 , 1 ] and
max ( α ζ , β ϵ ) + γ + δ 1 ,
min ( α ζ , β ϵ ) + γ + δ 0 .
We see immediately that
α A = α , β A = α , β , γ A ,
α , β , γ A = α , β , γ , δ A .
On the other hand, some of the operator arguments must be omitted. So, in the T1FS-case, these operators will obtain, respectively, the forms:
A = { x , μ A ( x ) 2 | x E } ,
A = { x , μ A ( x ) + 1 2 | x E } ;
α A = { x , α × μ A ( x ) | x E } ,
α A = { x , α × μ A ( x ) + 1 α | x E } ,
where α [ 0 , 1 ] ;
α , β A = { x , α × μ A ( x ) + β | x E } ,
where α , β , α + β [ 0 , 1 ] .
α , γ , ϵ A = { x , α × μ A ( x ) ϵ × ν A ( x ) + γ | x E } ,
where α , γ , ϵ , [ 0 , 1 ] and
α + γ 1 , γ ϵ 0 .
The topological operators can also be reduced to the T1FS-case, as follows:
C ( A ) = { x , sup y E μ A ( y ) | x E } ,
I ( A ) = { x , inf y E μ A ( y ) | x E } .
C μ ( A ) = { x , sup y E μ A ( y ) | x E } ,
C ν ( A ) = { x , μ A ( x ) | x E } ,
I μ ( A ) = { x , inf y E μ A ( y ) | x E } ,
I ν ( A ) = { x , min ( 1 sup y E ν A ( y ) , μ A ( x ) ) | x E } ,
C μ * ( A ) = { x , min ( sup y E μ A ( y ) , 1 ν A ( x ) ) | x E } ,
I ν * ( A ) = { x , min ( 1 sup y E ν A ( y ) , μ A ( x ) ) | x E } ,
where, again, ν A ( x ) = 1 μ A ( x ) . Therefore,
C ( A ) = C μ ( A ) ,
I ( A ) = I μ ( A ) ,
C ν is deprecated. The same is the situation with the last three topological operators, because:
I ν ( A ) = { x , min ( 1 sup y E ( 1 μ A ( y ) ) , μ A ( x ) ) | x E }
= { x , min ( 1 ( 1 inf y E ( μ A ( y ) ) ) , μ A ( x ) ) | x E }
= { x , min ( inf y E ( μ A ( y ) ) , μ A ( x ) ) | x E }
= { x , inf y E μ A ( x ) | x E } = I ( A ) ,
C μ * ( A ) = { x , min ( sup y E μ A ( y ) , μ A ( x ) ) | x E }
= { x , μ A ( x ) | x E } = A ,
I ν * ( A ) = { x , min ( 1 sup y E ( 1 μ A ( y ) ) , μ A ( x ) ) | x E }
= { x , min ( 1 ( 1 inf y E μ A ( y ) ) , μ A ( x ) ) | x E }
= { x , min ( inf y E μ A ( y ) , μ A ( x ) ) | x E }
= { x , inf y E μ A ( y ) | x E } = I ( A ) .
Therefore, only the first two topological operators ( C and I ) make sense in the T1FS-case.

4. Conclusions

IFSs is an extension of T1FS. The theory containing new operations, relations, and operators that essentially extend the operators defined over T1FSs. In this paper, we discussed which of them can be and which cannot be transformed over T1FSs. So, now it is clear that there are possibilities for development in new directions of the T1FSs.

Acknowledgments

The author is grateful to the anonymous reviewers for their very valuable comments. The present research has been supported by the Bulgarian National Science Fund under Grant Ref. No. DFNI-I-02-5 “InterCriteria Analysis: A New Approach to Decision Making”.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Goguen, J. L-fuzzy sets. J. Math. Anal. Appl. 1967, 18, 145–174. [Google Scholar] [CrossRef]
  3. Zadeh, L. The concept of a linguistic variable and its application to approximate reasoning. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  4. Pawlak, Z. Rough Sets Research Report PAS 431; Institute of Computer Science, Polish Academy of Sciences: Warsaw, Poland, 1981. [Google Scholar]
  5. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  6. Atanassov, K. Intuitionistic fuzzy sets. In Proceedings of the VII ITKR’s Session, Sofia, Bulgaria, 7–9 June 1983. (Deposed in Central Sci.- Techn. Library of Bulg. Acad. of Sci., 1697/84) (in Bulgaria); reprinted in Int. J. Bioautom. 2016, 20, S1–S6. [Google Scholar]
  7. Castillo, O.; Melin, P. Type-2 Fuzzy Logic: Theory and Applications; Springer: Berlin, Germany, 2008. [Google Scholar]
  8. Gonzalez, C.I.; Melin, P.; Castro, J.R.; Castillo, O. Edge Detection Methods Based on Generalized Type-2 Fuzzy Logic; Springer: Cham, Switzerland, 2017. [Google Scholar]
  9. Ponce-Cruz, P.; Molina, A.; MacCleery, B. Fuzzy Logic Type-1 and Type-2 Based on LabVIEW FPGA; Springer: Cham, Switzerland, 2016. [Google Scholar]
  10. Kaufmann, A. Introduction a La Theorie Des Sour-Ensembles Flous; Masson: Paris, France, 1977. [Google Scholar]
  11. Atanassov, K. Intuitionistic Fuzzy Sets; Springer: Heidelberg, Germany, 1999. [Google Scholar]
  12. Atanassov, K. On Intuitionistic Fuzzy Sets Theory; Springer: Berlin, Germany, 2012. [Google Scholar]
  13. Danchev, S. A new geometrical interpretation of some concepts in the intuitionistic fuzzy logics. Notes Intuit. Fuzzy Sets 1995, 1, 116–118. [Google Scholar]
  14. Szmidt, E. Applications of Intuitionistic Fuzzy Sets in Decision Making. Ph.D. Thesis, Technical University, Sofia, Bulgaria, 2000. [Google Scholar]
  15. Szmidt, E.; Kacprzyk, J. Similarity of intuitionistic fuzzy sets and the Jaccard coefficient. In Proceedings of the Tenth International Conference IPMU’2004, Perugia, Italy, 4–9 July 2004; Volume 2, pp. 1405–1412. [Google Scholar]
  16. Szmidt, E.; Kacprzyk, J. New measures of entropy for intuitionistic fuzzy sets. Notes Intuit. Fuzzy Sets 2005, 11, 12–20. [Google Scholar]
  17. Atanassov, K. New geometrical interpretation of the intuitionistic fuzzy pairs. Notes Intuit. Fuzzy Sets 2016, 22, 12–18. [Google Scholar]
  18. Atanassov, K. Intuitionistic Fuzzy Logics; Springer: Cham, Switzerland, 2017. [Google Scholar]
  19. Atanassov, K.; Szmidt, E.; Kacprzyk, J. New Fodor’s type of intuitionistic fuzzy implication and negation. Notes Intuit. Fuzzy Sets 2016, 22, 1–8. [Google Scholar]
  20. Atanassov, K.; Szmidt, E.; Kacprzyk, J. Intuitionistic fuzzy implication → 187. Notes Intuit. Fuzzy Sets 2017, 23, 37–43. [Google Scholar]
  21. Atanassov, K.; Szmidt, E.; Kacprzyk, J. Intuitionistic fuzzy implication → 188. Notes Intuit. Fuzzy Sets 2017, 23, 6–13. [Google Scholar]
  22. Atanassova, L. Intuitionistic fuzzy implication → 189. Notes Intuit. Fuzzy Sets 2017, 23, 14–20. [Google Scholar]
  23. Brouwer, L.E.J. Collected Works; North Holland: Amsterdam, The Netherlands, 1975; Volume 1. [Google Scholar]
  24. Van Dalen, D. (Ed.) Brouwer’s Cambridge Lectures on Intuitionism; Cambridge University Press: Cambridge, UK, 1981. [Google Scholar]
  25. Atanassov, K.; Gargov, G. Intuitionistic fuzzy logic operators of a set theoretical type. In Proceedings of the First Workshop on Fuzzy Based Expert Systems, Sofia, Bulgaria, 28–30 September 1994; pp. 39–42. [Google Scholar]
  26. Atanassova, V.; Doukovska, L. Compass-and-straightedge constructions in the intuitionistic fuzzy interpretational triangle: Two new intuitionistic fuzzy modal operators. Notes Intuit. Fuzzy Sets 2017, 23, 1–7. [Google Scholar]
  27. Kuratowski, K. Topology; Academies Press: New York, NY, USA, 1966; Volume 1. [Google Scholar]
  28. Yosida, K. Functional Analysis; Springer-Verlag: Berlin, Germany, 1965. [Google Scholar]
  29. Atanassov, K. Geometrical interpretation of the elements of the intuitionistic fuzzy objects. Preprint IM-MFAIS-1-89, Sofia, Bulgaria, 1989; reprinted in Int. J. Bioautom. 2016, 20, S27–S42.
  30. Gorzalczany, M. A method of inference in approximate reasoning based on interval-valued fuzzy sets. Fuzzy Sets Syst. 1987, 21, 1–17. [Google Scholar] [CrossRef]
Figure 1. First geometrical interpretation—first form.
Figure 1. First geometrical interpretation—first form.
Algorithms 10 00106 g001
Figure 2. First geometrical interpretation—second form.
Figure 2. First geometrical interpretation—second form.
Algorithms 10 00106 g002
Figure 3. V. Atanassova’s geometrical interpretation.
Figure 3. V. Atanassova’s geometrical interpretation.
Algorithms 10 00106 g003
Figure 4. Second geometrical interpretation.
Figure 4. Second geometrical interpretation.
Algorithms 10 00106 g004
Figure 5. Third geometrical interpretation.
Figure 5. Third geometrical interpretation.
Algorithms 10 00106 g005
Figure 6. Fourth geometrical interpretation, where α = π μ A ( x ) , β = π ν A ( x ) and here π = 3 . 14 .
Figure 6. Fourth geometrical interpretation, where α = π μ A ( x ) , β = π ν A ( x ) and here π = 3 . 14 .
Algorithms 10 00106 g006
Figure 7. S. Danchev’s geometrical interpretation.
Figure 7. S. Danchev’s geometrical interpretation.
Algorithms 10 00106 g007
Figure 8. Szmidt and Kacprzyk’s geometrical interpretation.
Figure 8. Szmidt and Kacprzyk’s geometrical interpretation.
Algorithms 10 00106 g008
Figure 9. Fifth geometrical interpretation.
Figure 9. Fifth geometrical interpretation.
Algorithms 10 00106 g009
Figure 10. Central point in the fifth geometrical interpretation.
Figure 10. Central point in the fifth geometrical interpretation.
Algorithms 10 00106 g010
Figure 11. Geometrical interpretation of a T1FS element.
Figure 11. Geometrical interpretation of a T1FS element.
Algorithms 10 00106 g011

Share and Cite

MDPI and ACS Style

Atanassov, K.T. Type-1 Fuzzy Sets and Intuitionistic Fuzzy Sets. Algorithms 2017, 10, 106. https://doi.org/10.3390/a10030106

AMA Style

Atanassov KT. Type-1 Fuzzy Sets and Intuitionistic Fuzzy Sets. Algorithms. 2017; 10(3):106. https://doi.org/10.3390/a10030106

Chicago/Turabian Style

Atanassov, Krassimir T. 2017. "Type-1 Fuzzy Sets and Intuitionistic Fuzzy Sets" Algorithms 10, no. 3: 106. https://doi.org/10.3390/a10030106

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop