Two kinds of rough algebras and brouwer-zadeh lattices

  • Authors:
  • Jian-Hua Dai;Hanfei Lv;Weidong Chen;Yunhe Pan

  • Affiliations:
  • Institute of Artificial Intelligence, Zhejiang University, Hangzhou, P.R. China;Department of Information Management, Zhejiang Police Vocational Academy, Hangzhou, P.R. China;Institute of Artificial Intelligence, Zhejiang University, Hangzhou, P.R. China;Institute of Artificial Intelligence, Zhejiang University, Hangzhou, P.R. China

  • Venue:
  • RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.