A Logic for Rough Sets

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

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Modeling incomplete information – fundamentals and application

  • Ewa Orlowska
  • 1997

Rough sets theory and logicalgebraic structures

  • Piero Pagliani
  • 1997

Abstract model theoretic approach to algebraic logic, CCSOM Working Paper 92–92

  • Hajnal Andréka, István Németi, Ildikó Sain
  • Department of Statistics and Methodology,
  • 1992

nski, Intelligent decision support: Handbook of applications and advances of rough set theory

  • Roman Słowi
  • Kluwer, Dordrecht,
  • 1992
1 Excerpt

There are general rules for specifying semantics : Observations on abstract model theory

  • Ildikó Sain
  • Computational Linguistics and Computer Languages
  • 1979

Similar Papers

Loading similar papers…