A partially ordered set is ω-chain complete if, for every countable chain, or ω-chain, in P, the least upper bound of C, denoted by sup C, exists. Notice that C could be empty, so an ω-chain complete partially ordered set has a least element, denoted by 0
