Splitting and jump inversion in the Turing degrees

DOI10.3233/COM-180083MaRDI QIDQ4683147zbMATH OpenFDO

Authors S. Barry Cooper, Mingji Xia, Angsheng Li

Publication date 20 September 2018

Published in Computability (Search for Journal in Brave)

zbMATH Keywords

splittingTuring degreesjump inversioncomputably enumerable degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Recommendations

• Splitting in 2-computably enumerable degrees with avoiding cones
• A Splitting with Infimum in the d-c. e. Degrees
• 1-generic splittings of computably enumerable degrees
• A splitting theorem for \(n\)-REA degrees
• New Computational Paradigms

Cited in

(14)

• Hierarchy of Computably Enumerable Degrees II
• Jumps of nontrivial splittings of recursively enumerable sets
• Non-uniformity and generalised Sacks splitting
• 1-generic splittings of computably enumerable degrees
• Turing jumps in the Ershov hierarchy
• Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
• Computably enumerable Turing degrees and the meet property
• Splitting into degrees with low computational strength
• Completely mitotic c.e. degrees and non-jump inversion
• Splitting in 2-computably enumerable degrees with avoiding cones
• New Computational Paradigms
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• scientific article; zbMATH DE number 5504384 (Why is no real title available?)
• Decomposition and infima in the computably enumerable degrees

This page was built for publication: Splitting and jump inversion in the Turing degrees

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