bounded

<mathematics> In domain theory, a subset S of a cpo X is bounded if there exists x in X such that for all s in S, s <= x. In other words, there is some element above all of S. If every bounded subset of X has a least upper bound then X is boundedly complete.

[FOLDOC]

<2001-03-16>

Try this search on OneLook / Google

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