Finite fuzzy sets

From MaRDI portal





The authors intend to do (finite) combinatorics for finite fuzzy sets, i.e. for fuzzy sets over a finite universe of discourse. Such fuzzy sets have finite sequences of \(\alpha\)-cuts. Of course, the authors cannot simply count membership functions. Therefore they introduce an equivalence relation which considers fuzzy sets \(A,B\) as equivalent iff both have coinciding kernels, supports, and sequences of cuts. The combinatorics now concernes these equivalence classes. The authors count different types of such classes. \{Reviewers remark: The authors introduce a completely superflous ``axiom which states: ``There is only one fuzzy subset \(\mu\) of the empty universe of discourse. And this fuzzy set has membership degree \(1\) everywhere. The first of these sentences is trivially true because one always has \({\emptyset}^{A}=\{\emptyset\}\), for standard sets, for any nonempty set \(A\). And the second sentence is meaningless because the domain of the fuzzy set \(\mu\) is the (crisp) empty set.\}











This page was built for publication: Finite fuzzy sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5460605)