Abstrakt
When modeling real complex situations, various simplifications and idealizations are indispensable. One way of handling such situations is to use the formalism of rough set theory.
Originally, the mathematical formalism of rough set theory deals with situations in which subsets of a fixed set are identified only within the limits given by an equivalence relation. Presently there exist many generalizations where equivalences are replaced by other relations, or coverings induced by equivalences are replaced by other types of coverings.
Analogous structures exist in many fields of pure or applied mathematics and computer science. The main purpose of this talk is to show how some well established structures appearing in algebra, topology, and logic are identical or closely related to those introduced and rediscovered in the rough set literature.