A New Proof of Friedman's Conjecture

DOI10.2178/bsl/1309952321zbMath1242.03064OpenAlexW1964790669WikidataQ122979975 ScholiaQ122979975MaRDI QIDQ3174641

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)

Related Items (4)

LUZIN’S (N) AND RANDOMNESS REFLECTION ⋮ RANDOMNESS IN THE HIGHER SETTING ⋮ AN APPLICATION OF RECURSION THEORY TO ANALYSIS ⋮ Continuous higher randomness

Cites Work

• Unnamed Item
• Lowness of higher randomness notions
• One hundred and two problems in mathematical logic
• Analytic determinacy and 0^#
• Randomness via effective descriptive set theory

This page was built for publication: A New Proof of Friedman's Conjecture