Jumping Through the Transfinite: The Master Code Hierarchy of Turing Degrees
Hodes, Harold T.
J. Symbolic Logic, Tome 45 (1980) no. 1, p. 204-220 / Harvested from Project Euclid
Where $\underline{a}$ is a Turing degree and $\xi$ is an ordinal $< (\aleph_1)^{L^\underline{a}}$, the result of performing $\xi$ jumps on $\underline{a},\underline{a}^{(\xi)}$, is defined set-theoretically, using Jensen's fine-structure results. This operation appears to be the natural extension through $(\aleph_1)^{L^\underline{a}}$ of the ordinary jump operations. We describe this operation in more degree-theoretic terms, examine how much of it could be defined in degree-theoretic terms and compare it to the single jump operation.
Publié le : 1980-06-14
Classification: 
@article{1183740554,
     author = {Hodes, Harold T.},
     title = {Jumping Through the Transfinite: The Master Code Hierarchy of Turing Degrees},
     journal = {J. Symbolic Logic},
     volume = {45},
     number = {1},
     year = {1980},
     pages = { 204-220},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183740554}
}
Hodes, Harold T. Jumping Through the Transfinite: The Master Code Hierarchy of Turing Degrees. J. Symbolic Logic, Tome 45 (1980) no. 1, pp.  204-220. http://gdmltest.u-ga.fr/item/1183740554/