<?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="Post&#039;s theorem - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=Post%27s_theorem&amp;p=2">3.Next</a>
</p>
<p>In <a href="page.php?w=computability_theory">computability theory</a>, <b>Post's theorem</b>, named after <a href="page.php?w=Emil_Post">Emil Post</a>, describes the connection between the <a href="page.php?w=arithmetical_hierarchy">arithmetical hierarchy</a> and the <a href="page.php?w=Turing_degree">Turing degree</a>s. </p>

<p><big> Background </big></p>
<p>The statement of Post's theorem uses several concepts relating to <a href="page.php?w=Structure_%28mathematical_logic%29">definability</a> and <a href="page.php?w=computability_theory">computability theory</a>.</p><p>
<a accesskey="3" href="page.php?w=Post%27s_theorem&amp;p=2">3.Next</a>
</p>

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

</card>
</wml>
