Journal of Symbolic Logic 64 (3):963-983 (1999)

Abstract
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 $\kappa$, and there is an inaccessible above $\kappa$, 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 $\kappa$ is extendible, there is an extendible Laver sequence at $\kappa$. 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 http://projecteuclid.org/euclid.jsl/1183745865
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 52,956
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Laver Sequences for Extendible and Super-Almost-Huge Cardinals.Paul Corazza - 1999 - Journal of Symbolic Logic 64 (3):963-983.
The Wholeness Axiom and Laver Sequences.Paul Corazza - 2000 - Annals of Pure and Applied Logic 105 (1-3):157-260.
The Lottery Preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
Consistency of V = HOD with the Wholeness Axiom.Paul Corazza - 2000 - Archive for Mathematical Logic 39 (3):219-226.
Strong Cardinals Can Be Fully Laver Indestructible.Arthur W. Apter - 2002 - Mathematical Logic Quarterly 48 (4):499-507.
Sacks Forcing, Laver Forcing, and Martin's Axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
Laver Indestructibility and the Class of Compact Cardinals.Arthur W. Apter - 1998 - Journal of Symbolic Logic 63 (1):149-157.
Guessing Models and Generalized Laver Diamond.Matteo Viale - 2012 - Annals of Pure and Applied Logic 163 (11):1660-1678.
C (N)-Cardinals.Joan Bagaria - 2012 - Archive for Mathematical Logic 51 (3-4):213-240.
On Extendible Cardinals and the GCH.Konstantinos Tsaprounis - 2013 - Archive for Mathematical Logic 52 (5-6):593-602.
Strongly Dominating Sets of Reals.Michal Dečo & Miroslav Repický - 2013 - Archive for Mathematical Logic 52 (7-8):827-846.
A Cardinal Pattern Inspired by AD.Arthur W. Apter - 1996 - Mathematical Logic Quarterly 42 (1):211-218.
Unfoldable Cardinals and the GCH.Joel 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.

Analytics

Added to PP index
2017-02-21

Total views
4 ( #1,179,471 of 2,344,001 )

Recent downloads (6 months)
1 ( #514,126 of 2,344,001 )

How can I increase my downloads?

Downloads

My notes