In domain theory, a complete partial order is boundedly complete if every bounded subset has a least upper bound. Also called consistently complete.

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 ]