Covering the recursive sets

DOI10.1016/j.apal.2016.10.017zbMath1422.03088OpenAlexW2543758722MaRDI QIDQ508828

Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn

Publication date: 8 February 2017

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.2016.10.017

zbMATH Keywords

recursion theoryalgorithmic randomnessdiagonally nonrecursive (DNR) setsinfinitely often subuniform families of setsSchnorr trivial setssets of hyperimmune-free degree

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Cites Work

• Relativized Schnorr tests with universal behavior
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Computational randomness and lowness
• A Δ₂⁰ set with no infinite low subset in either it or its complement
• An Analogy between Cardinal Characteristics and Highness Properties of Oracles
• Kolmogorov complexity and the Recursion Theorem
• Algorithmic Randomness and Complexity
• Schnorr trivial sets and truth-table reducibility
• Hyperimmune-free degrees and Schnorr triviality
• FORCING WITH BUSHY TREES
• Lowness for the Class of Schnorr Random Reals
• The Degrees of Hyperimmune Sets
• An introduction to Kolmogorov complexity and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item