A Poset is complete if every subset of has a Least Upper Bound. Note: has a greatest element and a least element . In particular, is not empty.