The statement of Post's theorem uses several concepts relating to definabilityTemplate:Dn and recursion theory. This section gives a brief overview of these concepts, which are covered in depth in their respective articles.
The arithmetical hierarchy classifies certain sets of natural numbers that are definable in the language of Peano arithmetic. A formula is said to be if it is an existential statement in prenex normal form (all quantifiers at the front) with alternations between existential and universal quantifiers applied to a quantifier free formula. Formally a formula in the language of Peano arithmetic is a formula if it is of the form
where contains only bounded quantifiers is provably equivalent to a formula of the above form from the axioms of Peano arithmetic. Thus it isn't uncommon to see formulas defined in this alternative and technically nonequivalent manner since in practice the distinction is rarely important.
A set of natural numbers A is said to be if it is definable by a formula, that is, if there is a formula such that each number n is in A if and only if holds. It is known that if a set is then it is for any , but for each m there is a set that is not . Thus the number of quantifier alternations required to define a set gives a measure of the complexity of the set.
Post's theorem uses the relativized arithmetical hierarchy as well as the unrelativized hierarchy just defined. A set A of natural numbers is said to be relative to a set B, written , if A is definable by a formula in an extended language that includes a predicate for membership in B.
While the arithmetical hierarchy measures definability of sets of natural numbers, Turing degrees measure the level of uncomputability of sets of natural numbers. A set A is said to be Turing reducible to a set B, written , if there is an oracle Turing machine that, given an oracle for B, computes the characteristic function of A. The Turing jump of a set A is a form of the Halting problem relative to A. Given a set A, the Turing jump is the set of indices of oracle Turing machines that halt on input 0 when run with oracle A. It is known that every set A is Turing reducible to its Turing jump, but the Turing jump of a set is never Turing reducible to the original set.
Post's theorem and corollaries
Post's theorem establishes a close connection between the arithmetical hierarchy and the Turing degrees of the form , that is, finitely iterated Turing jumps of the empty set. (The empty set could be replaced with any other computable set without changing the truth of the theorem.)
Post's theorem states:
- A set B is if and only if is recursively enumerable by an oracle Turing machine with an oracle for , that is, if and only if B is .
- The set is complete for every . This means that every set is many-one reducible to .
Post's theorem has many corollaries that expose additional relationships between the arithmetical hierarchy and the Turing degrees. These include:
- Fix a set C. A set B is if and only if B is . This is the relativization of the first part of Post's theorem to the oracle C.
- A set B is if and only if . More generally, B is if and only if .
- A set is defined to be arithmetical if it is for some n. Post's theorem shows that, equivalently, a set is arithmetical if and only if it is Turing reducible to for some m.
Rogers, H. The Theory of Recursive Functions and Effective Computability, MIT Press. ISBN 0-262-68052-1; ISBN 0-07-053522-1
Soare, R. Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987. ISBN 3-540-15299-7