In a lattice, any two elements 
and 
have a greatest lower bound. This greatest
lower bound is often called the meet of 
and 
,
and is denoted by 
.
One can also speak of the meet operation in a general partially ordered set. If 
and 
are two elements in some partially ordered set 
, and if there is a greatest element 
(with respect to the given order) with the property that 
and 
, then 
is said to be the meet of 
and 
.
