Information | |
---|---|
has gloss | eng: In mathematics, join and meet are dual binary operations on the elements of a partially ordered set. A join on a set is defined as the (necessarily unique) supremum (least upper bound) with respect to a partial order on the set, provided a supremum exists. A meet on a set is defined either as the unique infimum (greatest lower bound) with respect to a partial order on the set, provided an infimum exists. If the join of two elements with respect to a given partial order exists then it is always the meet of the two elements in the inverse order, and vice versa. |
lexicalization | eng: join and meet |
instance of | (noun) an operation that follows the rules of Boolean algebra; each operand and the result take one of two values binary arithmetic operation, boolean operation, binary operation |
Meaning | |
---|---|
Chinese | |
has gloss | zho: 在数学中,在一个集合上的交(meet)有两种定义:关于在这个集合上的偏序的唯一下确界(最大下界),假定下确界存在的话; 或者是满足幂等律的交换结合二元运算。在任何一个情况下,这个集合与交运算一起是半格。这两个定义产生等价的结果,除了在偏序方式中有可能直接定义更一般的元素的集合的交。最常见到交运算的领域是格。 |
lexicalization | zho: 交运算 |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint