Try Our Apps


Supposedly vs. Supposably

boundedly complete

boundedly complete in Technology

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

Word of the Day

Word Value for boundedly

Scrabble Words With Friends

Nearby words for boundedly complete