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