LARGE CARDINALS BEYOND CHOICE

2019 ◽  
Vol 25 (03) ◽  
pp. 283-318 ◽  
Author(s):  
JOAN BAGARIA ◽  
PETER KOELLNER ◽  
W. HUGH WOODIN

AbstractThe HOD Dichotomy Theorem states that if there is an extendible cardinal, δ, then either HOD is “close” to V (in the sense that it correctly computes successors of singular cardinals greater than δ) or HOD is “far” from V (in the sense that all regular cardinals greater than or equal to δ are measurable in HOD). The question is whether the future will lead to the first or the second side of the dichotomy. Is HOD “close” to V, or “far” from V? There is a program aimed at establishing the first alternative—the “close” side of the HOD Dichotomy. This is the program of inner model theory. In recent years the third author has provided evidence that there is an ultimate inner model—Ultimate-L—and he has isolated a natural conjecture associated with the model—the Ultimate-L Conjecture. This conjecture implies that (assuming the existence of an extendible cardinal) that the first alternative holds—HOD is “close” to V. This is the future in which pattern prevails. In this paper we introduce a very different program, one aimed at establishing the second alternative—the “far” side of the HOD Dichotomy. This is the program of large cardinals beyond choice. Kunen famously showed that if AC holds then there cannot be a Reinhardt cardinal. It has remained open whether Reinhardt cardinals are consistent in ZF alone. It turns out that there is an entire hierarchy of choiceless large cardinals of which Reinhardt cardinals are only the beginning, and, surprisingly, this hierarchy appears to be highly ordered and amenable to systematic investigation, as we shall show in this paper. The point is that if these choiceless large cardinals are consistent then the Ultimate-L Conjecture must fail. This is the future where chaos prevails.

1996 ◽  
Vol 2 (1) ◽  
pp. 94-107 ◽  
Author(s):  
Greg Hjorth

§0. Preface. There has been an expectation that the endgame of the more tenacious problems raised by the Los Angeles ‘cabal’ school of descriptive set theory in the 1970's should ultimately be played out with the use of inner model theory. Questions phrased in the language of descriptive set theory, where both the conclusions and the assumptions are couched in terms that only mention simply definable sets of reals, and which have proved resistant to purely descriptive set theoretic arguments, may at last find their solution through the connection between determinacy and large cardinals.Perhaps the most striking example was given by [24], where the core model theory was used to analyze the structure of HOD and then show that all regular cardinals below ΘL(ℝ) are measurable. John Steel's analysis also settled a number of structural questions regarding HODL(ℝ), such as GCH.Another illustration is provided by [21]. There an application of large cardinals and inner model theory is used to generalize the Harrington-Martin theorem that determinacy implies )determinacy.However, it is harder to find examples of theorems regarding the structure of the projective sets whose only known proof from determinacy assumptions uses the link between determinacy and large cardinals. We may equivalently ask whether there are second order statements of number theory that cannot be proved under PD–the axiom of projective determinacy–without appealing to the large cardinal consequences of the PD, such as the existence of certain kinds of inner models that contain given types of large cardinals.


2010 ◽  
Vol 75 (4) ◽  
pp. 1383-1402 ◽  
Author(s):  
James Cummings ◽  
Matthew Foreman

§1. Introduction. It is a well-known phenomenon in set theory that problems in infinite combinatorics involving singular cardinals and their successors tend to be harder than the parallel problems for regular cardinals. Examples include the behaviour of cardinal exponentiation, the extent of the tree property, the extent of stationary reflection, and the existence of non-free almost-free abelian groups. The explanation for this phenomenon lies in inner model theory, in particular core models and covering lemmas. If W is an inner model of V then1. W strongly covers V if every uncountable set of ordinals is covered by a set of the same V -cardinality lying in W.2. W weakly covers V if W computes the successor of every V-singular cardinal correctly.Strong covering implies weak covering.In inner model theory there are many theorems of the general form “if there is no inner model of large cardinal hypothesis X then there is an L-like inner model Kx which Y covers V”. Here the L-like properties of Kx always include GCH and Global Square. Examples include1. X is “0# exists”, Kx is L, Y is “strongly”.2. X is “there is a measurable cardinal”, Kx is the Dodd-Jensen core model, Y is “strongly”.3. X is “there is a Woodin cardinal”, Kx is the core model for a Woodin cardinal, Y is “weakly”.


2021 ◽  
Vol 27 (2) ◽  
pp. 221-222
Author(s):  
Alejandro Poveda

AbstractThe dissertation under comment is a contribution to the area of Set Theory concerned with the interactions between the method of Forcing and the so-called Large Cardinal axioms.The dissertation is divided into two thematic blocks. In Block I we analyze the large-cardinal hierarchy between the first supercompact cardinal and Vopěnka’s Principle (Part I). In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics (Part II and Part III).We commence Part I by investigating the Identity Crisis phenomenon in the region comprised between the first supercompact cardinal and Vopěnka’s Principle. As a result, we generalize Magidor’s classical theorems [2] to this higher region of the large-cardinal hierarchy. Also, our analysis allows to settle all the questions that were left open in [1]. Finally, we conclude Part I by presenting a general theory of preservation of $C^{(n)}$ -extendible cardinals under class forcing iterations. From this analysis we derive several applications. For instance, our arguments are used to show that an extendible cardinal is consistent with “ $(\lambda ^{+\omega })^{\mathrm {HOD}}<\lambda ^+$ , for every regular cardinal $\lambda $ .” In particular, if Woodin’s HOD Conjecture holds, and therefore it is provable in ZFC + “There exists an extendible cardinal” that above the first extendible cardinal every singular cardinal $\lambda $ is singular in HOD and $(\lambda ^+)^{\textrm {{HOD}}}=\lambda ^+$ , there may still be no agreement at all between V and HOD about successors of regular cardinals.In Part II and Part III we analyse the relationship between the Singular Cardinal Hypothesis (SCH) with other relevant combinatorial principles at the level of successors of singular cardinals. Two of these are the Tree Property and the Reflection of Stationary sets, which are central in Infinite Combinatorics.Specifically, Part II is devoted to prove the consistency of the Tree Property at both $\kappa ^+$ and $\kappa ^{++}$ , whenever $\kappa $ is a strong limit singular cardinal witnessing an arbitrary failure of the SCH. This generalizes the main result of [3] in two senses: it allows arbitrary cofinalities for $\kappa $ and arbitrary failures for the SCH.In the last part of the dissertation (Part III) we introduce the notion of $\Sigma $ -Prikry forcing. This new concept allows an abstract and uniform approach to the theory of Prikry-type forcings and encompasses several classical examples of Prikry-type forcing notions, such as the classical Prikry forcing, the Gitik-Sharon poset, or the Extender Based Prikry forcing, among many others.Our motivation in this part of the dissertation is to prove an iteration theorem at the level of the successor of a singular cardinal. Specifically, we aim for a theorem asserting that every $\kappa ^{++}$ -length iteration with support of size $\leq \kappa $ has the $\kappa ^{++}$ -cc, provided the iterates belong to a relevant class of $\kappa ^{++}$ -cc forcings. While there are a myriad of works on this vein for regular cardinals, this contrasts with the dearth of investigations in the parallel context of singular cardinals. Our main contribution is the proof that such a result is available whenever the class of forcings under consideration is the family of $\Sigma $ -Prikry forcings. Finally, and as an application, we prove that it is consistent—modulo large cardinals—the existence of a strong limit cardinal $\kappa $ with countable cofinality such that $\mathrm {SCH}_\kappa $ fails and every finite family of stationary subsets of $\kappa ^+$ reflects simultaneously.


2017 ◽  
Vol 23 (1) ◽  
pp. 1-109 ◽  
Author(s):  
W. HUGH WOODIN

AbstractWe give a fairly complete account which first shows that the solution to the inner model problem for one supercompact cardinal will yield an ultimate version ofLand then shows that the various current approaches to inner model theory must be fundamentally altered to provide that solution.


2001 ◽  
Vol 66 (3) ◽  
pp. 1058-1072
Author(s):  
Greg Hjorth

The purpose of this paper is to present a kind of boundedness lemma for direct limits of coarse structural mice, and to indicate some applications to descriptive set theory. For instance, this allows us to show that under large cardinal or determinacy assumptions there is no prewellorder ≤ of length such that for some formula ψ and parameter zif and only ifIt is a peculiar experience to write up a result in this area. Following the work of Martin, Steel, Woodin, and other inner model theory experts, there is an enormous overhang of theorems and ideas, and it only takes one wandering pebble to restart the avalanche. For this reason I have chosen to center the exposition around the one pebble at 1.7 which I believe to be new. The applications discussed in section 2 involve routine modifications of known methods.A detailed introduction to many of the techniques related to using the Martin-Steel inner model theory and Woodin's free extender algebra is given in the course of [1]. Certainly a familiarity with the Martin-Steel papers, [5] and [6], is a prerequisite, as is some knowledge of the free extender algebra. Probably anyone interested in this paper will already know the necessary descriptive set theory, most of which can be found in [4]. Discussion of earlier results in this direction can be found in [3] or [2].


2002 ◽  
Vol 67 (2) ◽  
pp. 721-736 ◽  
Author(s):  
Ralf-Dieter Schindler ◽  
John Steel ◽  
Martin Zeman

In this paper we shall repair some errors and fill some gaps in the inner model theory of [2]. The problems we shall address affect some quite basic definitions and proofs.We shall be concerned with condensation properties of canonical inner models constructed from coherent sequences of extenders as in [2]. Condensation results have the general form: if x is definable in a certain way over a level , then either x ∈ , or else from x we can reconstruct in a simple way.The first condensation property considered in [2] is the initial segment condition, or ISC. In section 1 we show that the version of this condition described in [2] is too strong, in that no coherent in which the extenders are indexed in the manner of [2], and which is such that L[] satisfies the mild large cardinal hypothesis that there is a cardinal which is strong past a measurable, can satisfy the full ISC of [2]. It follows that the coherent sequences constructed in [2] do not satisfy the ISC of [2]. We shall describe the weaker ISC which these sequences do satisfy, and indicate the small changes in the arguments of [2] this new condition requires.


2005 ◽  
Vol 70 (4) ◽  
pp. 1127-1136
Author(s):  
John R. Steel

§1. Introduction. The basic problem of inner model theory is how to construct mice satisfying hypotheses appreciably stronger than “there is a Woodin limit of Woodin cardinals”. We have a family of constructions, the Kc-constructions, which ought to produce such mice under the appropriate hypotheses on V. Perhaps the most important thing we lack is a proof that the countable elementary submodels of premice produced by a Kc-construction are ω1 + 1-iterable. The best partial results in this direction are those of Neeman ([4]) for Kc-constructions making use of full background extenders over V, and those of Andretta, Neeman, and Steel ([1]) for arbitrary Kc-constructions.Let be a countable premouse embedded by π into a level of the Kc-construction ℂ. If ℂ uses only full extenders over V as its background extenders, then π and ℂ enable one to lift an evolving iteration tree on to an iteration tree * on V. (See [3, §12].) The good behavior of * guarantees that of . The natural conjecture here is that V is ω1 + 1-iterable with respect to such trees* by the strategy of choosing the unique wellfounded branch. The open question here is uniqueness, since by [2] the uniqueness of the wellfounded branch chosen by * at limit stages strictly less than λ implies the existence of a wellfounded branch to be chosen at λ.


Sign in / Sign up

Export Citation Format

Share Document