Formal Description of Rough Sets

  • Edward Bryniarski
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


In the paper we present a formal description of rough sets within the limits of the generalized set theory, which is interpreted in the approximation of set theory. The rough sets are interpreted as an approximations, which are defined by means of the Pawlak’s rough sets.


Formal Description Basic Object Simple Object Elementary Theorem Selective Choice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Z. Pawlak, Rough Sets, Int. J. Inform. Comp. Sci., 11, 1982, p. 672–683.MathSciNetGoogle Scholar
  2. [2]
    Z. Pawlak, Rough Sets, Theoretical Aspects of Reasoning about Data, Kluwer, Dordrecht 1992.Google Scholar
  3. [3]
    E. Bryniarski, Formalna koncepcja zbiorów przyblizonych (Formal Conception of Rough Sets), the doctoral dissertation prepared under the supervision of Prof. Urszula Wybraniec Skardowska at University of Wroclaw, June 1993.Google Scholar
  4. [4]
    W. D. Blizard, Multiset Theory, Notre Dame Journal of Formal Logic, vol. 30, Number 1, winter 1989, p. 36–66.CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© British Computer Society 1994

Authors and Affiliations

  • Edward Bryniarski
    • 1
  1. 1.Department of Computer Science and Applied LogicUniversity of OpoleOpolePoland

Personalised recommendations