Proof of a Conjecture of Friedman

DOI10.2307/2041857zbMath0325.02029OpenAlexW4255296038MaRDI QIDQ4088803

Donald A. Martin

Publication date: 1976

Full work available at URL: https://doi.org/10.2307/2041857

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items (7)

VARIATIONS ON DETERMINACY AND ℵ_ω1 ⋮ LUZIN’S (N) AND RANDOMNESS REFLECTION ⋮ ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE ⋮ Classes of Polish spaces under effective Borel isomorphism ⋮ BASIS THEOREMS FOR -SETS ⋮ AN APPLICATION OF RECURSION THEORY TO ANALYSIS ⋮ Definable towers

Cites Work

• Borel sets and hyperdegrees
• Encodability of Kleene's O

This page was built for publication: Proof of a Conjecture of Friedman