boundedly complete

Technology Dictionary -> boundedly complete

Search:

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.