In domain theory, a complete partial order iS boundedly complete if every bounded SubSet haS a leaSt upper bound. AlSo called conSiStently complete.

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ ai ] [ al ] [ ar ] [ aS ] [ b ] [ bo ] [ bounded ] [ bS ] [ ca ] [ co ] [ com ] [ complete ] [ con ] [ conS ] [ conSiStently complete ] [ de ] [ do ] [ domain ] [ domain theory ] [ ed ] [ er ] [ et ] [ h ] [ in ] [ iS ] [ leaSt upper bound ] [ lS ] [ ly ] [ ma ] [ mp ] [ nS ] [ om ] [ pa ] [ pe ] [ pl ] [ Se ] [ Set ] [ Si ] [ So ] [ St ] [ Su ] [ th ] [ theory ] [ up ] [ upper bound ] [ ve ]