Post's Theorem

In computability theory Post's theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. As notation we say that a subset X of \omega is \Sigma_n if there is a \Sigma_n formula with free variable n which is true if and only if n is in X. Formally Post's theorem states:
  • For every n \geq 0, B \in \Sigma_{n+1} if and only if B is a recursively enumerable set with an oracle of some \Pi_n set or, equivalently, some \Sigma_n set.
  • \emptyset^{(n)}, i.e. the n-th Turing jump of the empty set is \Sigma_n complete for every n > 0.
  • B \in \Delta_{n+1} if and only if B \leq_T \emptyset^{(n)}, i.e. B is Turing reducible to \emptyset^{(n)}.
The first result says that the \Sigma_n sets represent sets which are computably enumerable with an oracle in a one lower set. The second result says that the Turing jumps form complete sets of the \Sigma_n (X complete for \Sigma_n means that every other set in \Sigma_n is Turing reducible from X). As immediate corollaries we get:
  • B \in \Delta_{n+1} if and only if B \leq_T \emptyset^{(n)}, i.e. B is Turing reducible to \emptyset^{(n)}.

 

<< PreviousWord BrowserNext >>
gapp
michel chartrand
uss normandy (cg 60)
uss monterey (cg 61)
turing degree
uss chancellorsville (cg 62)
aaron weiss
jig (disambiguation)
non statutory law
gordon freeman
bhat
lyusternik schnirelmann category
nut (hardware)
uss cowpens (cg 63)
tungsten handheld
uss gettysburg (cg 64)
chad 'corntassel' smith
sacoglossa
kilfenora
uss chosin (cg 65)
list of mayors of bloomington, minnesota
winter garden theatre
george murray
tiger pistol shrimp
defense meritorious service medal
uss hue city (cg 66)
uss vicksburg (cg 69)
uss lake erie (cg 70)
andromeda (comics)
polynesian airlines
jig (fishing)
clatskanie river
perdido street station
new crobuzon
list of spanish television channels
ben travers
modacrylic
royal tongan airlines
maria von trapp
hindenburg line
galo plaza lasso
fishing lure
james pleasants
lure