Jump embeddings in the Turing degrees

DOI10.2307/2274700zbMath0745.03036OpenAlexW2082980239MaRDI 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

zbMATH Keywords

Turing reducibilityTuring degreesarithmetical degreegap- \(n\) tracejump embeddingjump partial orderingjump traceTuring jump operator

Mathematics Subject Classification ID

Partial orders, general (06A06) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (5)

There is no ordering on the classes in the generalized high/low hierarchies ⋮ Implicit definability in arithmetic ⋮ Embedding jump upper semilattices into the Turing degrees ⋮ Degree Structures: Local and Global Investigations ⋮ Low Level Nondelegability Results: Domination and Recursive Enumeration

Cites Work

• The upper semi-lattice of degrees of recursive unsolvability

This page was built for publication: Jump embeddings in the Turing degrees