Comparing DNR and WWKL
From MaRDI portal
Publication:5311768
DOI10.2178/jsl/1102022212zbMath1076.03039arXiv1408.2281OpenAlexW3098373946WikidataQ56226695 ScholiaQ56226695MaRDI QIDQ5311768
Theodore A. Slaman, Bjørn Kjos-Hanssen, Steffen Lempp, Ambos-Spies, Klaus
Publication date: 29 August 2005
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2281
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other Turing degree structures (03D28)
Related Items
Refining the taming of the reverse mathematics zoo, Open Questions in Reverse Mathematics, MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY, Degrees of Unsolvability: A Tutorial, Extracting randomness within a subset is hard, Propagation of partial randomness, Ramsey-type graph coloring and diagonal non-computability, Separating principles below, On the uniform computational content of computability theory, FORCING WITH BUSHY TREES, Effective Bi-immunity and Randomness, Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions, MASS PROBLEMS AND HYPERARITHMETICITY, Unnamed Item, Subsystems of second-order arithmetic between \(\text{RCA}_{0}\) and \(\text{WKL}_{0}\), A DNC function that computes no effectively bi-immune set, On the logical strengths of partial solutions to mathematical problems, 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10, Diagonally non-computable functions and fireworks, On uniform relationships between combinatorial problems, Finding paths through narrow and wide trees, Mass Problems and Randomness, DNR AND INCOMPARABLE TURING DEGREES, Kolmogorov complexity and the Recursion Theorem, A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS, Mass problems associated with effectively closed sets, Cone avoiding closed sets, Diagonally Non-Computable Functions and Bi-Immunity
Cites Work
