On strongly jump traceable reals
From MaRDI portal
Publication:925851
DOI10.1016/j.apal.2007.11.014zbMath1140.03017OpenAlexW1981301339MaRDI QIDQ925851
Publication date: 23 May 2008
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.2007.11.014
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (9)
Strong jump-traceability. II: \(K\)-triviality ⋮ STRONG JUMP-TRACEABILITY ⋮ Families of permutations and ideals of Turing degrees ⋮ Computing from projections of random points ⋮ Upper bounds on ideals in the computably enumerable Turing degrees ⋮ Characterizing the strongly jump-traceable sets via randomness ⋮ Lowness for Demuth Randomness ⋮ Benign cost functions and lowness properties ⋮ Inherent enumerability of strong jump-traceability
Cites Work
- Working below a \(low_ 2\) recursively enumerable degree
- Strong jump-traceability. I: The computably enumerable case
- Interpolation and embedding in the recursively enumerable degrees
- Lowness properties and randomness
- On the degrees less than 0'
- Computational randomness and lowness
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Beyond strong jump traceability
- An extension of the nondiamond theorem in classical and α-recursion theory
- A recursively enumerable degree which will not split over all lesser ones
- Recursively enumerable sets and degrees
- Computational complexity, speedable and levelable sets
- Working below a high recursively enumerable degree
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On strongly jump traceable reals
