Proof of a Conjecture of Friedman

DOI10.2307/2041857MaRDI QIDQ4088803zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(9)

• An application of recursion theory to analysis
• Basis theorem for \(\Sigma_2^1\)-sets
• Definable towers
• 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
• Borel graphable equivalence relations
• Some more results on relativized Chaitin's

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

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