= Greatest lower bound in a partially ordered set
{title2=$\bigwedge S$}
= Greatest lower bound
{synonym}
= Meet
{synonym}
A <lower bound in a partially ordered set> which is greater than or equal to every other lower bound. For a pair it is written $a\wedge b$; an empty meet, when it exists, is the greatest element. In a <complete lattice>, every subset has a meet. In the <open-set frame>, this is the interior of the intersection, with finite meets given by the intersections themselves.
Back to article page
