In domain theory, a complete partial order is boundedly complete if every bounded subset has a least upper bound. Also called consistently complete.
BOUNDEDLY COMPLETE
Meaning of BOUNDEDLY COMPLETE in English
FOLDOC computer English dictionary. Английский словарь по компьютерам FOLDOC. 2012