catflap.org Online Dictionary Query

Query string:
Search type:
Database:

Database copyright information
Server information

1 definition found

From The Free On-line Dictionary of Computing (27 SEP 03) : [ foldoc ]


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

Questions or comments about this site? Contact dictionary@catflap.org Access Stats