On extendible cardinals and the GCH

Archive for Mathematical Logic 52 (5-6):593-602 (2013)
  Copy   BIBTEX

Abstract

We give a characterization of extendibility in terms of embeddings between the structures H λ . By that means, we show that the GCH can be forced (by a class forcing) while preserving extendible cardinals. As a corollary, we argue that such cardinals cannot in general be made indestructible by (set) forcing, under a wide variety of forcing notions

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

C(n)-cardinals.Joan Bagaria - 2012 - Archive for Mathematical Logic 51 (3-4):213-240.
Elementary chains and C (n)-cardinals.Konstantinos Tsaprounis - 2014 - Archive for Mathematical Logic 53 (1-2):89-118.
Laver sequences for extendible and super-almost-huge cardinals.Paul Corazza - 1999 - Journal of Symbolic Logic 64 (3):963-983.
Strongly unfoldable cardinals made indestructible.Thomas A. Johnstone - 2008 - Journal of Symbolic Logic 73 (4):1215-1248.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
On the indestructibility aspects of identity crisis.Grigor Sargsyan - 2009 - Archive for Mathematical Logic 48 (6):493-513.
Tall cardinals.Joel D. Hamkins - 2009 - Mathematical Logic Quarterly 55 (1):68-86.
Easton’s theorem in the presence of Woodin cardinals.Brent Cody - 2013 - Archive for Mathematical Logic 52 (5-6):569-591.
Unfoldable cardinals and the GCH.Joel David Hamkins - 2001 - Journal of Symbolic Logic 66 (3):1186-1198.
On colimits and elementary embeddings.Joan Bagaria & Andrew Brooke-Taylor - 2013 - Journal of Symbolic Logic 78 (2):562-578.
The failure of GCH at a degree of supercompactness.Brent Cody - 2012 - Mathematical Logic Quarterly 58 (1):83-94.

Analytics

Added to PP
2013-11-23

Downloads
27 (#554,860)

6 months
7 (#339,156)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Large cardinals need not be large in HOD.Yong Cheng, Sy-David Friedman & Joel David Hamkins - 2015 - Annals of Pure and Applied Logic 166 (11):1186-1198.
Elementary chains and C (n)-cardinals.Konstantinos Tsaprounis - 2014 - Archive for Mathematical Logic 53 (1-2):89-118.
On c-extendible cardinals.Konstantinos Tsaprounis - 2018 - Journal of Symbolic Logic 83 (3):1112-1131.
Ultrahuge cardinals.Konstantinos Tsaprounis - 2016 - Mathematical Logic Quarterly 62 (1-2):77-87.

View all 6 citations / Add more citations

References found in this work

The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
Fragile measurability.Joel Hamkins - 1994 - Journal of Symbolic Logic 59 (1):262-282.
Laver sequences for extendible and super-almost-huge cardinals.Paul Corazza - 1999 - Journal of Symbolic Logic 64 (3):963-983.

View all 9 references / Add more references