boundedly complete

from The Free On-line Dictionary of Computing (8 July 2008)
boundedly complete

   In domain theory, a complete partial order is boundedly
   complete if every bounded subset has a least upper bound.
   Also called consistently complete.
    

[email protected]