scientific article; zbMATH DE number 28544

MaRDI QIDQ3986256zbMATH OpenFDO

Authors Victor Selivanov

Publication date 27 June 1992

zbMATH Keywords

hierarchies of Turing degrees below 0'high-low degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Recommendations

• Turing jumps in the Ershov hierarchy
• Turing degrees and the Ershov hierarchy
• Ershov hierarchy and the T-jump
• Every \({\Delta}^0_2\)-set is natural, up to Turing equivalence
• T-Degrees, Jump Classes, and Strong Reducibilities

Cited in

(14)

• Elementary differences among jump classes
• Ershov hierarchy and the T-jump
• Turing degrees in refinements of the arithmetical hierarchy
• Precomplete numberings
• Turing reducibility in the fine hierarchy
• Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
• A Refinement of Lown and Highn for the R.E. Degrees
• Jump transformations and an embedding of O∞ into O2
• Every \({\Delta}^0_2\)-set is natural, up to Turing equivalence
• scientific article; zbMATH DE number 3941523 (Why is no real title available?)
• Jumps of Hemimaximal Sets
• scientific article; zbMATH DE number 1795232 (Why is no real title available?)
• Jumps of Minimal Degrees Below 0 ′
• Elementary Differences Among Jump Hierarchies

This page was built for publication:

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