semilattice
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Noun[edit]
semilattice (plural semilattices)
- (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]
References[edit]
- ^ Vaughan Pratt (2004) Chapter 1 : Lattice Theory[1], boole.stanford.edu, §1.2.2