In domain theorY, a complete partial order is boundedlY complete if everY bounded subset has a least upper bound. Also called consistentlY complete.

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