Turing reducibility in the fine hierarchy (Q2187259): Difference between revisions

In the 1980s, the second author introduced the fine hierarchy, a generalization of the Ershov hierarchy. Recently, the second and the third author [Algebra Logic 57, No. 3, 222--236 (2018; Zbl 1485.03155); translation from Algebra Logika 57, No. 3, 338--361 (2018)] showed that the Turing degrees of the sets at level \(\omega^\omega\) of this hierarchy are precisely the Turing degrees of the \(\Sigma^0_3\) sets, and that the same holds true at level \(\omega^\omega+1\). The present paper contrastingly proves, via a \(0'''\) priority argument, that level \(\omega^\omega+2\) contains additional Turing degrees.