boundedly complete

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.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)