Approximation spaces and definability for incomplete information systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1424, Issue , 1998, Pages 115-122

  Buszkowski, Wojciech ^a  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; INFORMATION SYSTEMS; INFORMATION USE;

APPROXIMATION SPACES; DEFINABILITY; GENERAL METHOD; INCOMPLETE INFORMATION SYSTEMS;

ROUGH SET THEORY;

EID: 38149140135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69115-4_17     Document Type: Conference Paper

References (7)

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