[1] : The Free On-line Dictionary of Computing (27 SEP 03)

least upper bound
     
         lub or "join", "supremum" the least upper bound of
        two elements a and b is an upper bound c such that a <= c and
        b <= c and if there is any other upper bound c' then c <= c'.
        the least upper bound of a set s is the smallest b such that
        for all s in s, s <= b.  the lub of mutually comparable
        elements is their maximum but in the presence of incomparable
        elements, if the lub exists, it will be some other element
        greater than all of them.
     
        lub is the dual to greatest lower bound.
     
        in latex, "<=" is written as \sqsubseteq, the lub of two
        elements a and b is written a \sqcup b, and the lub of set s
        is written as \bigsqcup s.
     
        1995-02-03
     
     
see also:
greatest lower bound latex \sqsubseteq \sqcup 

Bound >> B Words
Bound, definition of term: Bound
bound_pag1.html

Bound Morpheme >> B Words
Bound Morpheme, definition of term: Bound Morpheme
bound+morpheme_pag1.html

At Least >> A Words
At Least, definition of term: At Least
at+least_pag1.html

In The Least >> I Words
In The Least, definition of term: In The Least
in+the+least_pag1.html