Search in: Word
Vietnamese keyboard: Off
Virtual keyboard: Show
Computing (FOLDOC) dictionary (also found in English - English (Wordnet), English - Vietnamese)
Jump to user comments
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.