Supercompactness within the Projective Hierarchy

Journal of Symbolic Logic 66 (2):658-672 (2001)

Abstract

We show that all the projective ordinals $\delta^1_n$ are supercompact through their supremum $\aleph_{\varepsilon 0}$, and a ways beyond.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,879

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
15 (#704,592)

6 months
1 (#386,016)

Historical graph of downloads
How can I increase my downloads?

References found in this work

On the Determinacy of Games on Ordinals.L. A. Harrington - 1981 - Annals of Mathematical Logic 20 (2):109.

Add more references

Citations of this work

An inner model theoretic proof of Becker’s theorem.Grigor Sargsyan - 2019 - Archive for Mathematical Logic 58 (7-8):999-1003.

Add more citations

Similar books and articles

Projective Prewellorderings Vs Projective Wellfounded Relations.Xianghui Shi - 2009 - Journal of Symbolic Logic 74 (2):579-596.
Partial Near Supercompactness.Jason Aaron Schanker - 2013 - Annals of Pure and Applied Logic 164 (2):67-85.
The Weak Square Property.Steve Jackson - 2001 - Journal of Symbolic Logic 66 (2):640-657.
Sets and Singletons.Kai Hauser & W. Hugh Woodin - 1999 - Journal of Symbolic Logic 64 (2):590-616.
On HOD-Supercompactness.Grigor Sargsyan - 2008 - Archive for Mathematical Logic 47 (7-8):765-768.
Projective Spinor Geometry and Prespace.F. A. M. Frescura - 1988 - Foundations of Physics 18 (8):777-808.
The Weak Square Property.Steve Jackson - 2001 - Journal of Symbolic Logic 66 (2):640-657.
On Some Extensions of the Projective Hierarchy.Carlos A. Di Prisco & Jimena Llopis - 1987 - Annals of Pure and Applied Logic 36:105-113.
Undecidable Theories of Lyndon Algebras.Vera Stebletsova & Yde Venema - 2001 - Journal of Symbolic Logic 66 (1):207-224.