# Proof of a conjecture of Friedman

@inproceedings{Martin1976ProofOA,
title={Proof of a conjecture of Friedman},
author={D. Martin},
year={1976}
}
We prove that every uncountable hyperarithmetic set has a member of each hyperdegree > 0, the hyperdegree of Kleene's 0. We improve the main result of Friedman [1] by proving his conjecture that every uncountable hyperarithmetic set has a member of each hyperdegree > 0, the hyperdegree of Kleene's 0. This result has been obtained independently by Friedman by a different method. Friedman's proof uses ideas employed by L. Harrington to obtain a partial result. In [2] it is shown that there is a… Expand
12 Citations
AN APPLICATION OF RECURSION THEORY TO ANALYSIS
• L. Yu
• Computer Science, Mathematics
• The Bulletin of Symbolic Logic
• 2020
Definable Towers.
• Mathematics
• 2018
• PDF
ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE
• H. Becker
• Computer Science, Mathematics
• The Journal of Symbolic Logic
• 2020
• 1
Luzin's (N) and randomness reflection
• Mathematics
• 2020
• Highly Influenced
• PDF
A New Proof of Friedman's Conjecture
• L. Yu
• Computer Science, Mathematics
• The Bulletin of Symbolic Logic
• 2011
• 7
• PDF
Introduction to Q-Theory
• Mathematics
• 1983
• 36
BASIS THEOREMS FOR ${\rm{\Sigma }}_2^1$-SETS
• Mathematics, Computer Science
• The Journal of Symbolic Logic
• 2019
• Highly Influenced
RANDOMNESS IN THE HIGHER SETTING
• Mathematics, Computer Science
• The Journal of Symbolic Logic
• 2015
• 14
• Highly Influenced
• PDF

#### References

SHOWING 1-4 OF 4 REFERENCES
Encodability of Kleene's O
• Mathematics, Computer Science
• J. Symb. Log.
• 1973
• 2
Borel Sets and Hyperdegrees
• H. Friedman
• Mathematics, Computer Science
• J. Symb. Log.
• 1973
• 7
Encodability of Kleene's 0, J
• Symbolic Logic 38 (1973), 437^140. The Logic Group, Rockerfeller University, New York, New York 10021 Received by the editors January 6,
• 1975
AMS (MOS) subject classifications
• AMS (MOS) subject classifications
• 1970