Search in: Word
Vietnamese keyboard: Off
Virtual keyboard: Show
Computing (FOLDOC) dictionary
boundedly complete
Jump to user comments
In domain theory, a complete partial order is boundedly
complete if every bounded subset has a least upper bound.
Also called consistently complete.
Related search result for "boundedly complete"
Comments and discussion on the word "boundedly complete"