Turing reducibility in the fine hierarchy

DOI10.1016/J.APAL.2019.102766zbMath1471.03067OpenAlexW2998250867WikidataQ126565634 ScholiaQ126565634MaRDI QIDQ2187259

M. M. Yamaleev, Alexander G. Melnikov, Victor L. Selivanov

Publication date: 2 June 2020

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2019.102766

zbMATH Keywords

arithmetical hierarchyTuring degreeErshov hierarchyfine hierarchy

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)

Related Items (2)

Non-collapse of the effective Wadge hierarchy ⋮ On the main scientific achievements of Victor Selivanov

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notes on computable analysis
• Fine hierarchies and m-reducibilities in theoretical computer science
• Ershov hierarchy
• Iterated trees of strategies and priority arguments
• Computable structures and the hyperarithmetical hierarchy
• Turing degrees in refinements of the arithmetical hierarchy
• A survey of results on the d.c.e. and \(n\)-c.e. degrees
• A Survey of Results on the d-c.e. and n-c.e. Degrees
• The Veblen functions for computability theorists
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• On ω-regular sets
• Extending Cooper’s theorem to Δ 3 0 Turing degrees
• Fine hierarchies and Boolean terms
• PRIORITY ARGUMENTS VIA TRUE STAGES
• A Hierarchy of Turing Degrees

This page was built for publication: Turing reducibility in the fine hierarchy