Turing degrees in refinements of the arithmetical hierarchy

DOI10.1007/s10469-018-9495-4zbMath1485.03155OpenAlexW2893437199MaRDI QIDQ1757652

M. M. Yamaleev, Victor L. Selivanov

Publication date: 15 January 2019

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-018-9495-4

zbMATH Keywords

arithmetical hierarchyTuring degreesErshov 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 (4)

Non-collapse of the effective Wadge hierarchy ⋮ Turing reducibility in the fine hierarchy ⋮ On the main scientific achievements of Victor Selivanov ⋮ Precomplete numberings

Cites Work

• Hierarchies of hyperarithmetical sets and functions
• Ershov hierarchy
• On a hierarchy of sets. III
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Fine hierarchies and Boolean terms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Turing degrees in refinements of the arithmetical hierarchy