Consequence Relations and Information Systems

  • Dimiter Vakarelov
Part of the Theory and Decision Library book series (TDLD, volume 11)

Abstract

A representation theory for Scott consequence systems in property systems and in Pawlak’s information systems is developed. It is proved that each Scott’s information system can be represented in a certain Pawlak’s information system.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Gabbay D. M., Semantical Investigations in Heyting’s Intuitionistic Logic, Synthese Library v. 148, D. Reidel Publishing Company, Holland, 1981.Google Scholar
  2. [2]
    Pawlak Z., Information Systems Theoretical Foundations, Information systems, 6 (1981), 205–218.MATHCrossRefGoogle Scholar
  3. [3]
    Pawlak Z.,Systemy Informacyjne, WNT, Warszawa, 1983 (in Polish).Google Scholar
  4. [4]
    Rasiowa H. and G. Epstein, Approximation Reasoning and Scott’s Information Systems. In the proc. of International Symp. on Methodologies for Intelligent Systems’87, Charlotte, October 14–17, 1987, USA, North-Holland, 33–42.Google Scholar
  5. [5]
    Scott D., Domains for Denotational Semantics. A connected and expanded Version of a Paper Prepared for ICALP 1982, Aarhus, Denmark 1982.Google Scholar
  6. [6]
    Segerberg K., Classical Propositional Operators. Clarendon Press, Oxford, 1982.MATHGoogle Scholar
  7. [7]
    Vakarelov D.,Logical Analysis of Positive and Negative Similarity Relations in Property Systems, in the proc. of WOCFAI’91, July 1–5, 1991, Paris, ed. Michel De Glas and Dov Gabbay, pp 491–499.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1992

Authors and Affiliations

  • Dimiter Vakarelov
    • 1
  1. 1.Department of Mathematical Logic with Laboratory for Applied Logic Faculty of Mathematics and InformaticsSofia UniversitySofiaBulgaria

Personalised recommendations