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 κ, 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)|
|Through your library||Configure|
Similar books and articles
Arthur W. Apter (2001). Some Structural Results Concerning Supercompact Cardinals. Journal of Symbolic Logic 66 (4):1919-1927.
Arthur W. Apter & Joel David Hamkins (2003). Exactly Controlling the Non-Supercompact Strongly Compact Cardinals. Journal of Symbolic Logic 68 (2):669-688.
Tetsuya Ishiu (2005). Club Guessing Sequences and Filters. Journal of Symbolic Logic 70 (4):1037 - 1071.
Natasha Dobrinen & Sy-David Friedman (2006). Co-Stationarity of the Ground Model. Journal of Symbolic Logic 71 (3):1029 - 1043.
Masaru Kada (2000). More on Cichoń's Diagram and Infinite Games. Journal of Symbolic Logic 65 (4):1713-1724.
C. P. Schnorr & P. Fuchs (1977). General Random Sequences and Learnable Sequences. Journal of Symbolic Logic 42 (3):329-340.
Joel David Hamkins (2001). Unfoldable Cardinals and the GCH. Journal of Symbolic Logic 66 (3):1186-1198.
Arthur W. Apter & Moti Gitik (1998). The Least Measurable Can Be Strongly Compact and Indestructible. Journal of Symbolic Logic 63 (4):1404-1412.
Joel David Hamkins (1999). Gap Forcing: Generalizing the Lévy-Solovay Theorem. Bulletin of Symbolic Logic 5 (2):264-272.
Arthur W. Apter (1998). Laver Indestructibility and the Class of Compact Cardinals. Journal of Symbolic Logic 63 (1):149-157.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?