DNR and incomparable Turing degrees

DOI10.1017/FMS.2016.3OpenAlexW2963889441MaRDI QIDQ2805301FDOQ2805301

Authors: Minzhong Cai, Noam Greenberg, Michael McInerney 

Publication date: 11 May 2016

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

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

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 \(\Sigma_2^0\) induction

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• DNR and incomparable Turing degrees
• The typical Turing degree

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)