Counting of finite fuzzy subsets with applications to fuzzy recognition and selection strategies

Abstract

The counting of fuzzy subsets of a finite set is of great interest in both practical and theoretical contexts in Mathematics. We have used some counting techniques such as the principle of Inclusion-Exclusion and the Mõbius Inversion to enumerate the fuzzy subsets of a finite set satisfying different conditions. These two techniques are interdependent with the M¨obius inversion generalizing the principle of Inclusion-Exclusion. The enumeration is carried out each time we redefine new conditions on the set. In this study one of our aims is the recognition and identification of fuzzy subsets with same features, characteristics or conditions. To facilitate such a study, we use some ideas such as the Hamming distance, mid-point between two fuzzy subsets and cardinality of fuzzy subsets. Finally we introduce the fuzzy scanner of elements of a finite set. This is used to identify elements and fuzzy subsets of a set. The scanning process of identification and recognition facilitates the choice of entities with specified properties. We develop a procedure of selection under the fuzzy environment. This allows us a framework to resolve conflicting issues in the market place.