<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Completeness (order theory) - Page 16 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=completeness_(order_theory)&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=completeness_%28order_theory%29&amp;p=17">3.Next</a>
</p>
<p>subset X, the set of all finite suprema (joins) of X is directed and the supremum of this set (which exists by directed completeness) is equal to the supremum of X. Thus every set has a supremum and by the above observation we have a complete lattice. The other direction of the proof is trivial.<br/>
* Assuming the <a href="page.php?w=axiom_of_choice">axiom of choice</a>, a poset is chain complete if and only if it is a dcpo.</p>

<p><big>Completeness in terms of universal algebra</big></p>
<p>As explained above, the presence of certain completeness conditions</p><p>
<a accesskey="1" href="page.php?w=completeness_(order_theory)&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=completeness_%28order_theory%29&amp;p=17">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
