On a Conjecture of Kleene and Post
S. Barry Cooper · Mathematical logic quarterly · 2001
A proof is given that 0′ (the argest Turing degree containing a computably enumerable set) is definable in the structure of the degrees of unsolvability. This answers a long-standing question of Kleene and Post, and has a number of corollaries including the definability of the jump operator.