A duality between Pawlak's knowledge representation systems and bi-consequence systems
A duality between Pawlak's knowledge representation systems and certain information systems of logical type, called bi-consequence systems is established. As an application a first-order characterization of some informational relations is given and a completeness theorem for the corresponding modal logic INF is proved. It is shown that INF possesses finite model property and hence is decidable.