Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Two Kinds of Rough Algebras and Brouwer-Zadeh Lattices
| |
|
Logics in Rough Sets
Two Kinds of Rough Algebras and Brouwer-Zadeh Lattices
Jian-Hua Dai1 , Hanfei Lv2 , Weidong Chen1 and Yunhe Pan1
| (1) |
Institute of Artificial Intelligence, Zhejiang University, Hangzhou 310027, P.R. China |
| (2) |
Department of Information Management, Zhejiang Police Vocational Academy, Hangzhou 310018, P.R. China |
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. <lower approximation set, upper approximation set>. 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.
Fulltext Preview (Small, Large)
|
|
|
|
|
|