Encyclopedia

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)

Mentioned in

complete partial ordering
consistently complete
Scott domain

All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.