A bounded jump for the bounded Turing degrees
From MaRDI portal
Publication:2452680
DOI10.1215/00294527-2420660zbMath1307.03024arXiv1007.3692MaRDI QIDQ2452680
Bernard A. Anderson, Barbara F. Csima
Publication date: 4 June 2014
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3692
03D30: Other degrees and reducibilities in computability and recursion theory
03D28: Other Turing degree structures
Related Items
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Effective domination and the bounded jump, Bounded-low sets and the high/low hierarchy, Bounded low and high sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Density of a final segment of the truth-table degrees
- Computable structures and the hyperarithmetical hierarchy
- On a hierarchy of sets. III
- On degrees of unsolvability
- Turing Computability
- 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
- Recursive Enumerability and the Jump Operator