IN domaiN theory, a complete partial order is bouNdedly complete if every bouNded subset has a least upper bouNd. Also called coNsisteNtly complete.

N="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 ]