boundedly complete

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

Last updated: 2014-07-01

Try this search on Wikipedia, OneLook, Google

Nearby terms:

boundary value « boundary value analysis « bounded « boundedly complete » bound variable » bournebasic » Bourne shell

Loading