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. ("<=" is written in LaTeX as suBseteq). (1995-02-03)