Laver Sequences for Extendible and Super-Almost-Huge Cardinals
Corazza, Paul
J. Symbolic Logic, Tome 64 (1999) no. 1, p. 963-983 / Harvested from Project Euclid
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.
Publié le : 1999-09-14
Classification: 
@article{1183745865,
     author = {Corazza, Paul},
     title = {Laver Sequences for Extendible and Super-Almost-Huge Cardinals},
     journal = {J. Symbolic Logic},
     volume = {64},
     number = {1},
     year = {1999},
     pages = { 963-983},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745865}
}
Corazza, Paul. Laver Sequences for Extendible and Super-Almost-Huge Cardinals. J. Symbolic Logic, Tome 64 (1999) no. 1, pp.  963-983. http://gdmltest.u-ga.fr/item/1183745865/