boundedly complete

<theory>

(Or "consistently complete") In domain theory, a complete partial order is boundedly complete if every bounded subset has a least upper bound.

Last updated: 2014-07-01

Nearby terms:

boundedboundedly completebound variableBourne Again SHell

Try this search on Wikipedia, Wiktionary, Google, OneLook.



Loading