In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A conditionally complete lattice satisfies at least one of these properties for bounded and nonempty subsets.
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A conditionally complete lattice satisfies at least one of these properties for bounded and nonempty subsets.
Source: Wikipedia "Complete lattice" · CC BY-SA 4.0
Share this article: X · Bluesky