Rough sets determined by tolerances
arXiv:1303.6332 · doi:10.1016/j.ijar.2013.12.005
Abstract
We show that for any tolerance on , the ordered sets of lower and upper rough approximations determined by form ortholattices. These ortholattices are completely distributive, thus forming atomistic Boolean lattices, if and only if is induced by an irredundant covering of , and in such a case, the atoms of these Boolean lattices are described. We prove that the ordered set of rough sets determined by a tolerance on is a complete lattice if and only if it is a complete subdirect product of the complete lattices of lower and upper rough approximations. We show that is a tolerance induced by an irredundant covering of if and only if is an algebraic completely distributive lattice, and in such a situation a quasi-Nelson algebra can be defined on . We present necessary and sufficient conditions which guarantee that for a tolerance on , the ordered set is a lattice for all , where denotes the restriction of to the set and is the corresponding set of rough sets. We introduce the disjoint representation and the formal concept representation of rough sets, and show that they are Dedekind--MacNeille completions of .
arXiv commentRevised version (28 pages, 1 figure)
References in corpus (4)
Cited by in corpus (6)
- Representing regular pseudocomplemented Kleene algebras by tolerance-based rough sets
- Defining rough sets using tolerances compatible with an equivalence
- Algebraic Approach to Directed Rough Sets
- Defining rough sets as core-support pairs of three-valued functions
- The structure of rough sets defined by reflexive relations
- Prime filter structures of pseudocomplemented Kleene algebras and representation by rough sets