Computer Dictionary of Information Technology

boundedly complete

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