Double approximation and complete lattices

Taichi Haruna*, Yukio Pegio Gunji

*この研究の対応する著者

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルRough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings
ページ52-59
ページ数8
DOI
出版ステータスPublished - 2009
外部発表はい
イベント4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009 - Gold Coast, QLD, Australia
継続期間: 2009 7 142009 7 16

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5589 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009
国/地域Australia
CityGold Coast, QLD
Period09/7/1409/7/16

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Double approximation and complete lattices」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル