In domain theory, a complete partial order is boundedly complete if every bounded subset has a least upper bound. Also called consistently complete.
Try this search on Wikipedia, OneLook, Google
Nearby terms: boundary value « boundary value analysis « bounded « boundedly complete » bound variable » bournebasic » Bourne shell
Copyright 2010 Denis Howe