Approximation Spaces and Definability for Incomplete Information Systems

  • Wojciech Buszkowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1424)


Incomplete information systems are approached here by general methods of rough set theory (see Pawlak [6,7]). We define approximation spaces of incomplete information systems and study definability and strong definability of sets of objects.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Blamey, Partial logic, in: D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logic, vol. 3, D. Reidel, Dordrecht, 1986, 1–70.Google Scholar
  2. 2.
    L. Bolc and P. Borowik, Many-Valued Logics. 1. Theoretical Foundations, Springer, Berlin, 1992.zbMATHGoogle Scholar
  3. 3.
    S. Demri and E. Orłowska, Logical Analysis of Indiscernibility, in: E. Orłowska (ed.), Incomplete Information: Rough Set Analysis, Physica-Verlag, Heidelberg, 1998, 347–380.Google Scholar
  4. 4.
    S.C. Kleene, Introduction to metamathematics, North-Holland, Amsterdam, 1952.zbMATHGoogle Scholar
  5. 5.
    E. Orłowska and Z. Pawlak, Logical foundations of knowledge representation, ICS PAS Reports, 537, Warszawa, 1984.Google Scholar
  6. 6.
    Z. Pawlak, Information systems-theoretical foundations, Information Systems 6 (1981), 205–218.zbMATHCrossRefGoogle Scholar
  7. 7.
    Z. Pawlak, Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer, Dordrecht, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Wojciech Buszkowski
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceAdam Mickiewicz UniversityPoznańPoland

Personalised recommendations