Rough analysis in lattices.

Abstract

An outline of an algebraie generalization of the rough set theory is presented in the paper. It is shown that the majority of the basic concepts of this theory has an immediate algebraic generalization, and that some rough set facts are true in general algebraic structures. The formalism employed is that of lattice theory. New concepts of rough order, approximation space and rough (quantitative) approximation space are introduced and investigated. It is shown that the original Pawlak's theory of rough sets and information systems is a model of this general approach.Rough set; Information system; Rough dependenee; Rough lattiee; Approximation spaee;