Abstract
Many researchers study rough sets from the point of view of description of the rough set pairs (a rough set pair is also called a rough set), i.e.. Comer [4] showed that all the rough sets in an approximation space constructed a regular double Stone algebra. The constructed algebra is called the rough double Stone algebra in this paper. Pagliani [19] interpreted Rough Set System (all the rough sets in an approximation space in disjoint representation) as a Nelson algebra. The constructed Nelson algebra from an approximation space is called the rough Nelson algebra in this paper. It is showed that a rough double Stone algebra is a Brouwer-Zadeh lattice, and a rough Nelson algebra is a Brouwer-Zadeh lattice also. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Dai, J. H., Lv, H., Chen, W., & Pan, Y. (2006). Two kinds of rough algebras and Brouwer-Zadeh lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4259 LNAI, pp. 99–106). Springer Verlag. https://doi.org/10.1007/11908029_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
