Marginalia on a theorem of Woodin

Journal of Symbolic Logic 82 (1):359-374 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

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

Through your library

Similar books and articles

Easton’s theorem in the presence of Woodin cardinals.Brent Cody - 2013 - Archive for Mathematical Logic 52 (5-6):569-591.
Inner models in the region of a Woodin limit of Woodin cardinals.Itay Neeman - 2002 - Annals of Pure and Applied Logic 116 (1-3):67-155.
The consistency strength of projective absoluteness.Kai Hauser - 1995 - Annals of Pure and Applied Logic 74 (3):245-295.
On a problem of Woodin.Arthur W. Apter - 2000 - Archive for Mathematical Logic 39 (4):253-259.
A strong boundedness theorem for dilators.A. S. Kechris & W. H. Woodin - 1991 - Annals of Pure and Applied Logic 52 (1-2):93-97.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Extenders, Embedding Normal Forms, and the Martin-Steel-Theorem.Peter Koepke - 1998 - Journal of Symbolic Logic 63 (3):1137-1176.
The Largest Countable Inductive Set is a Mouse Set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Collapsing functions.Ernest Schimmerling & Boban Velickovic - 2004 - Mathematical Logic Quarterly 50 (1):3-8.
Woodin cardinals and presaturated ideals.Noa Goldring - 1992 - Annals of Pure and Applied Logic 55 (3):285-303.
How Woodin changed his mind: new thoughts on the Continuum Hypothesis.Colin J. Rittberg - 2015 - Archive for History of Exact Sciences 69 (2):125-151.
Inner models with many Woodin cardinals.J. R. Steel - 1993 - Annals of Pure and Applied Logic 65 (2):185-209.

Analytics

Added to PP
2017-03-26

Downloads
18 (#781,713)

6 months
7 (#339,156)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
The Logic of Provability.Philip Scowcroft - 1995 - Philosophical Review 104 (4):627.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.
A Note on a Theorem of H. FRIEDMAN.C. Dimitracopoulos & J. Paris - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):13-17.

View all 8 references / Add more references