A new proof of Friedman's conjecture

DOI10.2178/BSL/1309952321MaRDI QIDQ3174641zbMATHOpenAlexWikidataFDO

Authors Liang Yu

Publication date 11 October 2011

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8de1bab51471c3507bec34fe24d8e471afa45990

zbMATH Keywords

realshyperdegree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• On the Kleene degrees of Π₁¹ sets
• Comparing incomparable kleene degrees
• scientific article; zbMATH DE number 4108753
• Minimality in the Δ⅓-degrees
• The strength of the projective Martin conjecture

Cites work

• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• Analytic determinacy and 0^#
• Lowness of higher randomness notions
• One hundred and two problems in mathematical logic
• Randomness via effective descriptive set theory

Cited in

(8)

• An application of recursion theory to analysis
• Comparing incomparable kleene degrees
• The Cerny Conjecture Holds with High Probability
• scientific article; zbMATH DE number 4071864 (Why is no real title available?)
• Randomness in the higher setting
• LUZIN’S (N) AND RANDOMNESS REFLECTION
• scientific article; zbMATH DE number 4106829 (Why is no real title available?)
• Continuous higher randomness

This page was built for publication: A new proof of Friedman's conjecture

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