@ARTICLE { Rsds71,
author = {Duntsch, Ivo},
title = {A logic for rough sets},
journal = {Theoretical Computer Science},
number = {(no. 1-2)},
volume = 179,
pages = {427-436},
publisher = {Elsevier Science Inc.},
address = {Amsterdam, The Netherlands},
month = {June},
year = 1997,
issn = {0304-3975},
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 Katriak (1974), we present such a logic for rough sets and its algebraic semantics in the spirit of Andreka and Nemeti (1994).},
keywords = {algebraic semantics, approximation space, boolean algebra, classical propositional logic, fuzzy logic, fuzzy set theory, regular double Stone algebra, representation theorem, rough sets logic, },
}