A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A logic for rough sets
1997
Theoretical Computer Science
The collection of all subsets of a set forms a Boolean algebra under the usual set-theoretic operations, while the collection of rough sets of an approximation space is a regular double Stone algebra (Pomykala and Pomykala, 1988) . The appropriate class of algebras for classical propositional logic are Boolean algebras, and it is reasonable to assume that regular double Stone algebras are a class of algebras appropriate for a logic of rough sets. Using the representation theorem for these
doi:10.1016/s0304-3975(96)00334-9
fatcat:huvo5vrdjzatzfwzzivr7qsmze