complete partial orders
Description: Partially ordered mathematical sets in which every directed subset has a least upper bound, used in order theory and computer science.
Primary topic: Logic, programming, and type systems (71%)
Related topic: Logic, programming, and type systems (71%)
Wikidata ID: wiki/Q3082805
OpenAlex ID: keywords/complete-partial-orders
