The structure of rough sets defined by reflexive relations
arXiv:2412.10863 · doi:10.1016/j.ijar.2025.109471
Abstract
For several types of information relations, the induced rough sets system RS does not form a lattice but only a partially ordered set. However, by studying its Dedekind-MacNeille completion DM(RS), one may reveal new important properties of rough set structures. Building upon D. Umadevi's work on describing joins and meets in DM(RS), we previously investigated pseudo-Kleene algebras defined on DM(RS) for reflexive relations. This paper delves deeper into the order-theoretic properties of DM(RS) in the context of reflexive relations. We describe the completely join-irreducible elements of DM(RS) and characterize when DM(RS) is a spatial completely distributive lattice. We show that even in the case of a non-transitive reflexive relation, DM(RS) can form a Nelson algebra, a property generally associated with quasiorders. We introduce a novel concept, the core of a relational neighborhood, and use it to provide a necessary and sufficient condition for DM(RS) to determine a Nelson algebra.
References in corpus (8)
- Rough sets determined by tolerances
- Rough Sets Determined by Quasiorders
- 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
- Monteiro spaces and rough sets determined by quasiorder relations: Models for Nelson algebras
- Pseudo-Kleene algebras determined by rough sets
- Nelson algebras, residuated lattices and rough sets: A survey