Laver sequences for extendible and super-almost-huge cardinals

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


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



    Upload a copy of this work     Papers currently archived: 79,857

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

Some structural results concerning supercompact cardinals.Arthur W. Apter - 2001 - Journal of Symbolic Logic 66 (4):1919-1927.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Unfoldable cardinals and the GCH.Joel David Hamkins - 2001 - Journal of Symbolic Logic 66 (3):1186-1198.
General random sequences and learnable sequences.C. P. Schnorr & P. Fuchs - 1977 - Journal of Symbolic Logic 42 (3):329-340.
More on cichoń's diagram and infinite games.Masaru Kada - 2000 - Journal of Symbolic Logic 65 (4):1713-1724.
Co-stationarity of the Ground Model.Natasha Dobrinen & Sy-David Friedman - 2006 - Journal of Symbolic Logic 71 (3):1029 - 1043.
Club guessing sequences and filters.Tetsuya Ishiu - 2005 - Journal of Symbolic Logic 70 (4):1037-1071.


Added to PP

191 (#73,227)

6 months
1 (#479,713)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
On extendible cardinals and the GCH.Konstantinos Tsaprounis - 2013 - Archive for Mathematical Logic 52 (5-6):593-602.
The wholeness axiom and Laver sequences.Paul Corazza - 2000 - Annals of Pure and Applied Logic 105 (1-3):157-260.
PFA and Ideals on $\omega_{2}$ Whose Associated Forcings Are Proper.Sean Cox - 2012 - Notre Dame Journal of Formal Logic 53 (3):397-412.
Ultrahuge cardinals.Konstantinos Tsaprounis - 2016 - Mathematical Logic Quarterly 62 (1-2):77-87.

View all 9 citations / Add more citations

References found in this work

The Higher Infinite.Akihiro Kanamori - 2000 - Studia Logica 65 (3):443-446.
Strong axioms of infinity and elementary embeddings.Robert M. Solovay - 1978 - Annals of Mathematical Logic 13 (1):73.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.

View all 6 references / Add more references