Turing reducibility in the fine hierarchy
DOI10.1016/J.APAL.2019.102766zbMATH Open1471.03067OpenAlexW2998250867WikidataQ126565634 ScholiaQ126565634MaRDI QIDQ2187259FDOQ2187259
Authors: Alexander Melnikov, M. M. Yamaleev, Victor 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
Recommendations
Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Invariant descriptive set theory
- Title not available (Why is that?)
- Computable structures and the hyperarithmetical hierarchy
- Title not available (Why is that?)
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Title not available (Why is that?)
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- On ω-regular sets
- Title not available (Why is that?)
- Fine hierarchies and Boolean terms
- Title not available (Why is that?)
- Fine hierarchies and m-reducibilities in theoretical computer science
- The Veblen functions for computability theorists
- Notes on computable analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turing degrees in refinements of the arithmetical hierarchy
- A Hierarchy of Turing Degrees
- A survey of results on the d.c.e. and \(n\)-c.e. degrees
- Ershov hierarchy
- Title not available (Why is that?)
- A survey of results on the d-c.e. and n-c.e. degrees
- Iterated trees of strategies and priority arguments
- Extending Cooper's theorem to \(\Delta_3^0\) Turing degrees
- PRIORITY ARGUMENTS VIA TRUE STAGES
Cited In (11)
- On the main scientific achievements of Victor Selivanov
- Turing degrees in refinements of the arithmetical hierarchy
- Fine hierarchies and m-reducibilities in theoretical computer science
- Effectivity and reducibility with ordinal Turing machines
- Extending Cooper's theorem to \(\Delta_3^0\) Turing degrees
- Query-monotonic Turing reductions
- Non-collapse of the effective Wadge hierarchy
- Turing Tumble is Turing-complete
- Turing degrees and the Ershov hierarchy
- Turing-Completeness Totally Free
- Turing-Complete Subclasses of CHR
This page was built for publication: Turing reducibility in the fine hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2187259)
