Laver sequences for extendible and super-almost-huge cardinals

Journal of Symbolic Logic 64 (3):963-983 (1999)
Versions of Laver sequences are known to exist for supercompact and strong cardinals. Assuming very strong axioms of infinity, Laver sequences can be constructed for virtually any globally defined large cardinal not weaker than a strong cardinal; indeed, under strong hypotheses, Laver sequences can be constructed for virtually any regular class of embeddings. We show here that if there is a regular class of embeddings with critical point κ, and there is an inaccessible above κ, then it is consistent for there to be a regular class that admits no Laver sequence. We also show that extendible cardinals are Laver-generating, i.e., that assuming only that κ is extendible, there is an extendible Laver sequence at κ. We use the method of proof to answer a question about Laver-closure of extendible cardinals at inaccessibles. Finally, we consider Laver sequences for super-almost-huge cardinals. Assuming slightly more than super-almost-hugeness, we show that there are super-almost-huge Laver sequences, improving the previously known upper bound for such Laver sequences. We also describe conditions under which the canonical construction of a Laver sequence fails for super-almost-huge cardinals
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586614
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,169
Through your library
References found in this work BETA

Add more references

Citations of this work BETA
The Lottery Preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
The Wholeness Axiom and Laver Sequences.Paul Corazza - 2000 - Annals of Pure and Applied Logic 105 (1-3):157-260.
The Axiom of Infinity and Transformations J: V→V.Paul Corazza - 2010 - Bulletin of Symbolic Logic 16 (1):37-84.
Lifting Elementary Embeddings J: V Λ → V Λ. [REVIEW]Paul Corazza - 2007 - Archive for Mathematical Logic 46 (2):61-72.

Add more citations

Similar books and articles
Some Structural Results Concerning Supercompact Cardinals.Arthur W. Apter - 2001 - Journal of Symbolic Logic 66 (4):1919-1927.
Club Guessing Sequences and Filters.Tetsuya Ishiu - 2005 - Journal of Symbolic Logic 70 (4):1037-1071.
Co-Stationarity of the Ground Model.Natasha Dobrinen & Sy-David Friedman - 2006 - Journal of Symbolic Logic 71 (3):1029 - 1043.
More on Cichoń's Diagram and Infinite Games.Masaru Kada - 2000 - Journal of Symbolic Logic 65 (4):1713-1724.
General Random Sequences and Learnable Sequences.C. P. Schnorr & P. Fuchs - 1977 - Journal of Symbolic Logic 42 (3):329-340.
Unfoldable Cardinals and the GCH.Joel David Hamkins - 2001 - Journal of Symbolic Logic 66 (3):1186-1198.
Gap Forcing: Generalizing the Lévy-Solovay Theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Laver Indestructibility and the Class of Compact Cardinals.Arthur W. Apter - 1998 - Journal of Symbolic Logic 63 (1):149-157.
Added to PP index

Total downloads
180 ( #25,970 of 2,191,856 )

Recent downloads (6 months)
1 ( #288,547 of 2,191,856 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature