boundedly complete

Computing Dictionary

boundedly complete definition

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

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: bounded interval
Next Definition: bounden
Words Near: boundedly complete
More from
Synonyms and Antonyms for boundedly complete
More from
Search for articles containing boundedly complete Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature