(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
Better Than TripAdvisor
- Holiday destination reviews, hotel information,
pictures, sightseeing advice and food reviews.
Updated: Wed Aug 31 04:46:45 2016
No longer supported by Imperial College Department of Computing
Copyright Denis Howe 1985