Boundedly complete
In domain theory, a complete partial order is boundedly complete if every bounded subset has a least upper bound. Also called consistently complete.
| < Previous Terms | Terms Containing boundedly complete | Next Terms > |
| bounce bounce message boundary scan boundary value analysis bounded | boundedly complete complete partial ordering consistently complete Scott domain | bound variable bournebasic Bourne shell boustrophedonic box |
