最終更新日
：2024/08/02
semilattice
noun
(mathematics)
A
partially
ordered
set
that
either
has
a
join
(a
least
upper
bound)
for
any
nonempty
finite
subset
(a
join-semilattice
or
upper
semilattice)
or
has
a
meet
(or
greatest
lower
bound)
for
any
nonempty
finite
subset
(a
meet-semilattice
or
lower
semilattice).
Equivalently,
an
underlying
set
which
has
a
binary
operation
which
is
associative,
commutative,
and
idempotent.
意味（1）
(mathematics)
A
partially
ordered
set
that
either
has
a
join
(a
least
upper
bound)
for
any
nonempty
finite
subset
(a
join-semilattice
or
upper
semilattice)
or
has
a
meet
(or
greatest
lower
bound)
for
any
nonempty
finite
subset
(a
meet-semilattice
or
lower
semilattice).
Equivalently,
an
underlying
set
which
has
a
binary
operation
which
is
associative,
commutative,
and
idempotent.
復習用の問題
(mathematics) A partially ordered set that either has a join (a least upper bound) for any nonempty finite subset (a join-semilattice or upper semilattice) or has a meet (or greatest lower bound) for any nonempty finite subset (a meet-semilattice or lower semilattice). Equivalently, an underlying set which has a binary operation which is associative, commutative, and idempotent.
正解を見る
semilattice
A semilattice is a partially ordered set in which every pair of elements has a unique least upper bound and a unique greatest lower bound.
正解を見る
A semilattice is a partially ordered set in which every pair of elements has a unique least upper bound and a unique greatest lower bound.
English Dictionary
項目の編集設定
- 項目の編集権限を持つユーザー - すべてのユーザー
- 項目の新規作成を審査する
- 項目の編集を審査する
- 項目の削除を審査する
- 重複の恐れのある項目名の追加を審査する
- 項目名の変更を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
例文の編集設定
- 例文の編集権限を持つユーザー - すべてのユーザー
- 例文の削除を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
問題の編集設定
- 問題の編集権限を持つユーザー - すべてのユーザー
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
