•  
  •  
 

Information Sciences Letters

Information Sciences Letters

Abstract

Matroids, rough set theory and lattices are efficient tools of knowledge discovery. Lattices and matroids are studied on preapproximations spaces. Li et al. proved that a lattice is Boolean if it is clopen set lattice for matroids. In our study, a lattice is Boolean if it is closed for matroids. Moreover, a topological lattice is discussed using its matroidal structure. Atoms in a complete atomic Boolean lattice are completely determined through its topological structure. Finally, a necessary and sufficient condition for a predefinable set is proved in preapproximation spaces. The value k for a predefinable set in lattice of matroidal closed sets is determined.

Share

COinS