Abstract
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 algebras by Katrin̆ák (1974), we present such a logic for rough sets and its algebraic semantics in the spirit of Andréka and Németi (1994).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.