DNR and incomparable Turing degrees

DOI10.1017/FMS.2016.3MaRDI QIDQ2805301zbMATH OpenOpenAlexFDO

Authors Minzhong Cai, Noam Greenberg, Michael McInerney

Publication date 11 May 2016

Published in Forum of Mathematics, Sigma (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1504.02805

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Other Turing degree structures (03D28) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Comparing DNR and WWKL
• The thin set theorem for pairs implies DNR
• scientific article; zbMATH DE number 4118353
• scientific article; zbMATH DE number 4087652
• Comparing the strength of diagonally nonrecursive functions in the absence of _2⁰ induction

Cites work

• 2-minimality, jump classes and a note on natural definability
• A 2-MINIMAL NON-GL₂ DEGREE
• A fixed-point-free minimal degree
• A hyperimmune minimal degree and an ANR 2-minimal degree
• A measure-theoretic proof of Turing incomparability
• Comparing DNR and WWKL
• Diagonally non-recursive functions and effective Hausdorff dimension
• Turing incomparability in Scott sets

Cited in

(2)

• The typical Turing degree
• DNR and incomparable Turing degrees

This page was built for publication: DNR and incomparable Turing degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805301)