意味 |
bounded latticeとは 意味・読み方・使い方
追加できません
(登録数上限)

Wiktionary英語版での「bounded lattice」の意味 |
bounded lattice
名詞
bounded lattice (複数形 bounded lattices)
- (algebra, order theory) Any lattice (type of partially ordered set) that has both a greatest and a least element.
- 2004, Anna Maria Radzikowska, Etienne Kerre, On L-Fuzzy Rough Sets, Leszek Rutkowski, Jörg Siekmann, Ryszard Tadeusiewicz, Lotfi A. Zadeh (editors), Artificial Intelligence and Soft Computing — ICAISC 2004: 7th International Conference, Proceedings, Springer, LNAI 3070, page 526,
- A residuated lattice is an extension of a bounded lattice by a monoid operation and its residuum, which are abstract counterparts of a triangular norm and a fuzzy residual implication, respectively.
- 2006, Bart Van Gasse, Chris Cornelis, Glad Deschrijver, Etienne Kerre, Triangle Lattices: Towards an Axiomatization of Interval-Valued Residuated Lattices, Salavatore Greco, Yukata Hata, Shoji Hirano, Masahiro Inuiguchi, Sadaaki Miyamoto, Hung Son Nguyen, Roman Słowiński (editors), Rough Sets and Current Trends in Computing: 5th International Conference, Proceedings, Springer, LNAI 4259, page 117,
- 2018, Gül Deniz Çayli, Funda Karaçal, Some Remarks on Idempotent Nullnorms on Bounded Lattices, Vicenç Torra, Radko Mesiar, Bernard De Baets (editors), Aggregation Functions in Theory and in Practice, Springer, page 32,
- In this paper, we study idempotent nullnorms on bounded lattices. We prove that there is no idempotent nullnorm on a distributive bounded lattice L different from the proposal in [13].
- 2004, Anna Maria Radzikowska, Etienne Kerre, On L-Fuzzy Rough Sets, Leszek Rutkowski, Jörg Siekmann, Ryszard Tadeusiewicz, Lotfi A. Zadeh (editors), Artificial Intelligence and Soft Computing — ICAISC 2004: 7th International Conference, Proceedings, Springer, LNAI 3070, page 526,
使用する際の注意点
The greatest element is usually denoted 1 and serves as the identity element of the meet operation, ∧. The least element, usually denoted 0, serves as the identity element of the join operation, ∨. The notations ⊤ and ⊥ are also used, less often, for greatest and least element respectively.
A bounded lattice may be defined formally as a tuple, . Regarding as an already defined lattice leads to the join and meet functions being, implicitly, defined in terms of the partial relation, . Alternatively (regarding as a set), the partial relation can be defined in terms of the join and meet functions.
For any . That is, the elements 0 and 1 are each comparable with every other element of the lattice.
Further reading
- Lattice (order) on Wikipedia.
- Greatest and least elements on Wikipedia.
- Heyting algebra on Wikipedia.
|
意味 |
|
bounded latticeのページの著作権
英和・和英辞典
情報提供元は
参加元一覧
にて確認できます。
Copyright © 2025 CJKI. All Rights Reserved | |
Text is available under Creative Commons Attribution-ShareAlike (CC-BY-SA) and/or GNU Free Documentation License (GFDL). Weblio英和・和英辞典に掲載されている「Wiktionary英語版」の記事は、Wiktionaryのbounded lattice (改訂履歴)の記事を複製、再配布したものにあたり、Creative Commons Attribution-ShareAlike (CC-BY-SA)もしくはGNU Free Documentation Licenseというライセンスの下で提供されています。 |
ピン留めアイコンをクリックすると単語とその意味を画面の右側に残しておくことができます。 |
![]() ログイン |
Weblio会員(無料)になると
![]() |


![]() | 「bounded lattice」のお隣キーワード |
weblioのその他のサービス
![]() ログイン |
Weblio会員(無料)になると
![]() |