boundedly complete

<mathematics> In domain theory, a complete partial order is boundedly complete if every bounded subset has a least upper bound. Also called consistently complete.

[FOLDOC]

<2001-03-16>

Try this search on OneLook / Google

Nearby terms: bottom-up implementation « bottom-up model « bounded « boundedly complete » bounded minimization » boundless the » bound variable