Bounded
<theory> 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).
| < Previous Terms | Terms Containing bounded | Next Terms > |
| botwar bounce bounce message boundary scan boundary value analysis | algebra BIFF bounded boundedly complete code grinder | boundedly complete bound variable bournebasic Bourne shell boustrophedonic |
