Jump embeddings in the Turing degrees
From MaRDI portal
Publication:3984430
DOI10.2307/2274700zbMath0745.03036MaRDI QIDQ3984430
Theodore A. Slaman, Peter G. Hinman
Publication date: 27 June 1992
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274700
Turing reducibility; Turing degrees; arithmetical degree; gap- \(n\) trace; jump embedding; jump partial ordering; jump trace; Turing jump operator
06A06: Partial orders, general
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Embedding jump upper semilattices into the Turing degrees, Implicit definability in arithmetic, There is no ordering on the classes in the generalized high/low hierarchies, Low Level Nondelegability Results: Domination and Recursive Enumeration, Degree Structures: Local and Global Investigations
Cites Work