scientific article; zbMATH DE number 1077010
The paper deals with algebraic structures related to rough sets, introduced by Pawlak in 1982. It is proved that the lattice of all rough subsets of a given rough set is a complete Heyting algebra. Necessary and sufficient conditions for the above lattice to be a Boolean algebra are presented. The relationships between rough sets and Heyting algebras (valued sets) is also analyzed in the framework of category theory. It is shown that the category of rough sets is isomorphic with the category of so-called rough 4-valued sets. It happens that an object isomorphic with a rough set need not be a rough set itself.
- On the category of rough sets
- Lattice Theory for Rough Sets
- Rough set theory applied to lattice theory
- \(T\)-rough sets based on the lattices
- Rough Sets and Brouwer-Zadeh Lattices
- Categories of fuzzy sets and fuzzy groups and the lattices of subobjects of these categories
- scientific article; zbMATH DE number 754421
- Rough sets and matroids from a lattice-theoretic viewpoint
- scientific article; zbMATH DE number 1983109
- Lattices defined by multigranular rough sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4360141)