A new proof of Friedman's conjecture

Bulletin of Symbolic Logic 17 (3):455-461 (2011)
  Copy   BIBTEX

Abstract

We give a new proof of Friedman's conjecture that every uncountable Δ11 set of reals has a member of each hyperdegree greater than or equal to the hyperjump

Categories

Keywords

Reprint years

DOI

10.2178/bsl/1309952321

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,105

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Vaught Conjecture: Do Uncountable Models Count?John T. Baldwin - 2007 - Notre Dame Journal of Formal Logic 48 (1):79-92.
A new proof that analytic sets are Ramsey.Erik Ellentuck - 1974 - Journal of Symbolic Logic 39 (1):163-165.
Riemann, Metatheory, and Proof, Rev.3.Michael Lucas Monterey & Michael Lucas-Monterey - manuscript
Epsilon Substitution Method for Δ11 − CR: a Constructive Termination Proof.Sergei Tupailo - 2003 - Logic Journal of the IGPL 11 (3):367-377.
The mouse set conjecture for sets of reals.Grigor Sargsyan & John Steel - 2015 - Journal of Symbolic Logic 80 (2):671-683.
A conjectural classification of strongly dependent fields.Yatir Halevi, Assaf Hasson & Franziska Jahnke - 2019 - Bulletin of Symbolic Logic 25 (2):182-195.
Weak Well Orders and Fraïssé’s Conjecture.Anton Freund & Davide Manca - forthcoming - Journal of Symbolic Logic:1-16.
Proof of a conjecture of Goodman.N. J. Fine - 1954 - Journal of Symbolic Logic 19 (1):41-44.
A proof of morley's conjecture.Bradd Hart - 1989 - Journal of Symbolic Logic 54 (4):1346-1358.
Proof of Mostowski's Conjecture.R. O. Gandy - 1964 - Journal of Symbolic Logic 29 (2):103-104.

Analytics

Added to PP
2011-07-07

Downloads
56 (#368,391)

6 months
19 (#145,028)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Randomness in the higher setting.C. T. Chong & Liang Yu - 2015 - Journal of Symbolic Logic 80 (4):1131-1148.
Continuous higher randomness.Laurent Bienvenu, Noam Greenberg & Benoit Monin - 2017 - Journal of Mathematical Logic 17 (1):1750004.
An application of recursion theory to analysis.Liang Yu - 2020 - Bulletin of Symbolic Logic 26 (1):15-25.
Luzin’s (n) and randomness reflection.Arno Pauly, Linda Westrick & Liang Yu - 2022 - Journal of Symbolic Logic 87 (2):802-828.

Add more citations

References found in this work

One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
Analytic determinacy and 0#. [REVIEW]Leo Harrington - 1978 - Journal of Symbolic Logic 43 (4):685 - 693.

Add more references