Jump embeddings in the Turing degrees

DOI10.2307/2274700MaRDI QIDQ3984430zbMATH OpenOpenAlexFDO

Authors Peter G. Hinman, Theodore A. Slaman

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

arithmetical degreegap- \(n\) tracejump embeddingjump partial orderingjump traceTuring degreesTuring jump operatorTuring reducibility

Mathematics Subject Classification ID

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

Recommendations

• Publication:4946098
• Embedding jump upper semilattices into the Turing degrees
• Orderings with αth Jump Degree 0 (α)

Cites work

• The upper semi-lattice of degrees of recursive unsolvability

Cited in

(12)

• Embedding of countable orders in Turing degrees
• Low level nondefinability results: domination and recursive enumeration
• Implicit definability in arithmetic
• Degree Structures: Local and Global Investigations
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• scientific article; zbMATH DE number 5504384 (Why is no real title available?)
• Degrees coded in jumps of orderings
• Orderings with αth Jump Degree 0 (α)
• Embedding jump upper semilattices into the Turing degrees
• scientific article; zbMATH DE number 1421073 (Why is no real title available?)
• Turing jumps in the Ershov hierarchy
• There is no ordering on the classes in the generalized high/low hierarchies

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984430)