Search Dictionary:  

boundedly complete

 Sponsored Links: 
 
Computing Dictionary
 
 Definition: 

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

 

 

COPYRIGHT © 2000-2009 HYPERDICTIONARY.COM HYPERDICTIONARY.COM