Highly Influenced

5 Excerpts

@article{Dntsch1997ALF, title={A Logic for Rough Sets}, author={Ivo D{\"u}ntsch}, journal={Theor. Comput. Sci.}, year={1997}, volume={179}, pages={427-436} }

- Published in Theor. Comput. Sci. 1997
DOI:10.1016/S0304-3975(96)00334-9

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 [24]. 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 Katriňák [16], we… CONTINUE READING