Rough Sets Determined by Quasiorders

Abstract

In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different kinds of complementation operations, and we describe its completely join-irreducible elements. We also characterize the case in which this lattice is a Stone lattice. Our results generalize some results of J. Pomykala and J. A. Pomykala (1988) and M. Gehrke and E. Walker (1992) in case $R$ is an equivalence.

arXiv comment18 pages, major revision

Cited by in corpus (9)

• Rough sets determined by tolerances
• Information completeness in Nelson algebras of rough sets induced by quasiorders
• Representation of Nelson Algebras by Rough Sets Determined by Quasiorders
• Representing regular pseudocomplemented Kleene algebras by tolerance-based rough sets
• Pseudo-Kleene algebras determined by rough sets
• Nelson algebras, residuated lattices and rough sets: A survey
• Defining rough sets as core-support pairs of three-valued functions
• Prime filter structures of pseudocomplemented Kleene algebras and representation by rough sets
• The structure of rough sets defined by reflexive relations