A Note on Rough Set Algebra and Core Regular Double Stone Algebras
Daniel J. Clouse

TL;DR
This paper explores the algebraic structure of rough set systems, demonstrating their isomorphism to core regular double Stone algebras and their applications to quantum state spaces.
Contribution
It establishes the isomorphism between rough set algebras and core regular double Stone algebras, and shows how to embed rough set algebras into these structures, with applications to quantum theory.
Findings
Rough set algebras are isomorphic to core regular double Stone algebras.
Crisp sets form a complete atomistic Boolean algebra.
The power set of pure states in quantum mechanics is a complete, atomistic Boolean algebra.
Abstract
Rough Set Theory (RST), first introduced by Pawlak in 1982, is an approach for dealing with information systems where knowledge is uncertain or incomplete.\cite{Pawlak} It is of fundamental importance in many subfields of artificial intelligence and cognitive science.\cite{RSTppf} Given a universe with an equivalence relation , the pair is referred to as an information system and we denote its collection of rough sets . In our main Theorem we show with to be isomorphic to core regular double Stone algebras, CRDSA, that are complete and atomic, and that the crisp, or definable, sets form a complete atomistic Boolean algebra. These guarantees of infimum/supremeum for arbitrary subsets and formulations in terms of fundamental elements are likely useful if dealing with equivalence relations with an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Natural Language Processing Techniques · Advanced Algebra and Logic
