|Title:||Fuzzifying closure systems and fuzzy lattices||Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||Volume:||4482 LNAI||First page:||111||Last page:||118||Conference:||11th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computer, RSFDGrC 2007; Toronto; Canada; 14 May 2007 through 17 May 2007||Issue Date:||1-Dec-2007||Rank:||M23||ISBN:||978-3-540-72530-5||ISSN:||0302-9743||DOI:||10.1007/978-3-540-72530-5_13||Abstract:||
A fuzzifying closure system is introduced as a fuzzy set on the collection of subsets of a nonempty set. It is proved that this structure is a particular fuzzy lattice ordered poset. Conversely, every lattice ordered poset is isomorphic to a fuzzifying closure system. In particular, each complete fuzzy lattice is representable by a fuzzifying closure system.
|Keywords:||Fuzzifying closure system | Fuzzy complete lattice | Fuzzy lattice | Lattice ordered fuzzy poset||Publisher:||Springer Link|
Show full item record
checked on Aug 11, 2023
checked on Sep 12, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.