A new proof of Friedman's conjecture

DOI10.2178/BSL/1309952321zbMATH Open1242.03064OpenAlexW1964790669WikidataQ122979975 ScholiaQ122979975MaRDI QIDQ3174641FDOQ3174641

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

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

zbMATH Keywords

realshyperdegree

Mathematics Subject Classification ID

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

Cites Work

• One hundred and two problems in mathematical logic
• Title not available (Why is that?)
• Analytic determinacy and 0^#
• Randomness via effective descriptive set theory
• Lowness of higher randomness notions

Cited In (8)

• Title not available (Why is that?)
• The Cerny Conjecture Holds with High Probability
• Title not available (Why is that?)
• Comparing incomparable kleene degrees
• Randomness in the higher setting
• An application of recursion theory to analysis
• LUZIN’S (N) AND RANDOMNESS REFLECTION
• 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)