Bounded low and high sets
From MaRDI portal
Publication:2402957
DOI10.1007/s00153-017-0537-8zbMath1417.03239MaRDI QIDQ2402957
Barbara F. Csima, Karen M. Lange, Bernard A. Anderson
Publication date: 15 September 2017
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-017-0537-8
03D30: Other degrees and reducibilities in computability and recursion theory
03D28: Other Turing degree structures
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Density of a final segment of the truth-table degrees
- Computable structures and the hyperarithmetical hierarchy
- A bounded jump for the bounded Turing degrees
- Turing Computability
- A Refinement of Lown and Highn for the R.E. Degrees
- Limits on jump inversion for strong reducibilities
- Automorphisms of the truth-table degrees are fixed on a cone
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- A Hierarchy of Turing Degrees