TY - GEN
T1 - Double approximation and complete lattices
AU - Haruna, Taichi
AU - Gunji, Yukio Pegio
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
KW - Complete lattices
KW - Equivalence of categories
KW - Representation theorem
KW - Rough sets
UR - http://www.scopus.com/inward/record.url?scp=69049085681&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=69049085681&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02962-2_7
DO - 10.1007/978-3-642-02962-2_7
M3 - Conference contribution
AN - SCOPUS:69049085681
SN - 3642029612
SN - 9783642029615
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 52
EP - 59
BT - Rough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings
T2 - 4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009
Y2 - 14 July 2009 through 16 July 2009
ER -