The Free On-line Dictionary of Computing (30 December 2018):

boundedly complete
consistently complete

    (Or "consistently complete") In domain theory, a
   complete partial order is boundedly complete if every bounded
   subset has a least upper bound.

   (2014-07-01)