Journal of Symbolic Logic

Jumping Through the Transfinite: The Master Code Hierarchy of Turing Degrees

Harold T. Hodes

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 45, Issue 2 (1980), 204-220.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183740554

Mathematical Reviews number (MathSciNet)
MR569393

Zentralblatt MATH identifier
0441.03014

JSTOR
links.jstor.org

Citation

Hodes, Harold T. Jumping Through the Transfinite: The Master Code Hierarchy of Turing Degrees. J. Symbolic Logic 45 (1980), no. 2, 204--220. https://projecteuclid.org/euclid.jsl/1183740554


Export citation