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.

Nearby terms:
boundary scan « boundary value analysis « bounded « boundedly complete » bound variable » bournebasic » Bourne shell