An Algebraic Approach to the Approximation of Information
Stephen D. Comer · Fundamenta Informaticae · 1991
This paper is based on the notion of an information system in the sense of Pawlak. Every set of knowledge P ⊆ Ω determines a closure operator on U. The class of Boolean algebras with added operations determined by all sets of know ledge are axiomatixed. As a consequence of the representation theorem information systems can be constructed that have a prescribed lattice of functional dependencies.