THESAURUS

Semilattice Thesaurus

(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.

Related Words

Related dictionary entries include uppersemilattice, subuppersemilattice, bilattice, ideal, hypersemigroup, lattice.

Continue With Semilattice

Relationships are shown only after the shared lexical validator accepts them. A suggestion is not automatically an exact replacement.