Double helix in large large cardinals and iteration of elementary embeddings

Annals of Pure and Applied Logic 146 (2):199-236 (2007)
  Copy   BIBTEX

Abstract

We consider iterations of general elementary embeddings and, using this notion, point out helices of consistency-wise implications between large large cardinals.Up to now, large cardinal properties have been considered as properties which cannot be accessed by any weaker properties and it has been known that, with respect to this relation, they form a proper hierarchy. The helices we point out significantly change this situation: the same sequence of large cardinal properties occurs repeatedly, changing only the parameters.As results of our investigation of this helical structure, we have new characterizations of extendible cardinals and of Vopěnkan cardinals in terms of elementary embeddings from the universe V, a new large large cardinal property which looks like Shelahness properly between Vopěnkaness and almost hugeness, and a more direct relation between Vopěnkaness and Woodinness than already known.We also consider limits of the helices and relations with the axioms I1–I3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Ramsey-like cardinals.Victoria Gitman - 2011 - Journal of Symbolic Logic 76 (2):519 - 540.
On colimits and elementary embeddings.Joan Bagaria & Andrew Brooke-Taylor - 2013 - Journal of Symbolic Logic 78 (2):562-578.
Elementary chains and C (n)-cardinals.Konstantinos Tsaprounis - 2014 - Archive for Mathematical Logic 53 (1-2):89-118.
Chains of end elementary extensions of models of set theory.Andrés Villaveces - 1998 - Journal of Symbolic Logic 63 (3):1116-1136.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
C(n)-cardinals.Joan Bagaria - 2012 - Archive for Mathematical Logic 51 (3-4):213-240.
Proper forcing and remarkable cardinals II.Ralf-Dieter Schindler - 2001 - Journal of Symbolic Logic 66 (3):1481-1492.
Perfect trees and elementary embeddings.Sy-David Friedman & Katherine Thompson - 2008 - Journal of Symbolic Logic 73 (3):906-918.
Abstract logic and set theory. II. large cardinals.Jouko Väänänen - 1982 - Journal of Symbolic Logic 47 (2):335-346.
Large cardinals and iteration trees of height ω.Alessandro Andretta - 1991 - Annals of Pure and Applied Logic 54 (1):1-15.
Lifting elementary embeddings j: V λ → V λ. [REVIEW]Paul Corazza - 2007 - Archive for Mathematical Logic 46 (2):61-72.

Analytics

Added to PP
2013-12-30

Downloads
33 (#473,861)

6 months
13 (#184,769)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Strong axioms of infinity and elementary embeddings.Robert M. Solovay - 1978 - Annals of Mathematical Logic 13 (1):73.
Elementary embeddings and infinitary combinatorics.Kenneth Kunen - 1971 - Journal of Symbolic Logic 36 (3):407-413.
The bounded proper forcing axiom.Martin Goldstern & Saharon Shelah - 1995 - Journal of Symbolic Logic 60 (1):58-73.
Implications between strong large cardinal axioms.Richard Laver - 1997 - Annals of Pure and Applied Logic 90 (1-3):79-90.
Proper forcing and remarkable cardinals II.Ralf-Dieter Schindler - 2001 - Journal of Symbolic Logic 66 (3):1481-1492.

View all 8 references / Add more references