Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
Categorical properties of M-indiscernibility spaces
Theoretical Computer Science
Double Approximation and Complete Lattices
Fundamenta Informaticae - Knowledge Technology
Hi-index | 0.00 |
A representation theorem for complete lattices by double approximation systems proved in [Gunji, Y.-P., Haruna, T., submitted] is analyzed in terms of category theory. A double approximation system consists of two equivalence relations on a set. One equivalence relation defines the lower approximation and the other defines the upper approximation. It is proved that the representation theorem can be extended to an equivalence of categories.