Defining rough sets using tolerances compatible with an equivalence
Combinatorics
2019-10-23 v2 Discrete Mathematics
Rings and Algebras
Abstract
We consider tolerances compatible with an equivalence on , meaning that the relational product is included in . We present the essential properties of -compatible tolerances and study rough approximations defined by such and . We consider rough set pairs , where the lower approximation is defined as is customary in rough set theory, but allows more elements to be possibly in than . Motivating examples of -compatible tolerances are given, and the essential lattice-theoretical properties of the ordered set of rough sets are established.
Cite
@article{arxiv.1811.09609,
title = {Defining rough sets using tolerances compatible with an equivalence},
author = {Jouni Järvinen and László Kovács and Sándor Radeleczki},
journal= {arXiv preprint arXiv:1811.09609},
year = {2019}
}
Comments
In press, accepted manuscript