scholarly journals The Jensen Covering Property

2001 ◽  
Vol 66 (4) ◽  
pp. 1505-1523 ◽  
Author(s):  
E. Schimmerling ◽  
W. H. Woodin

The Jensen covering lemma says that either L has a club class of indiscernibles, or else, for every uncountable set A of ordinals, there is a set B ∈ L with A ⊆ B and card (B) = card(A). One might hope to extend Jensen's covering lemma to richer core models, which for us will mean to inner models of the form L[] where is a coherent sequence of extenders of the kind studied in Mitchell-Steel [8], The papers [8], [12], [10] and [1] show how to construct core models with Woodin cardinals and more. But, as Prikry forcing shows, one cannot expect too direct a generalization of Jensen's covering lemma to core models with measurable cardinals.Recall from [8] that if L[] is a core model and α is an ordinal, then either Eα = ∅, or else Eα is an extender over As in [8], we assume here that if Eα is an extender, then Eα is below superstrong type in the sense that the set of generators of Eα is bounded in (crit(Eα)). Let us say that L[] is a lower-part core model iff for every ordinal α, Eα is not a total extender over L[]. In other words, if L[] is a lower-part core model, then no cardinal in L[] is measurable as witnessed by an extender on . Other than the “below superstrong” hypothesis, we impose no bounds on the large cardinal axioms true in the levels of a lower-part core model.

1996 ◽  
Vol 61 (2) ◽  
pp. 621-639 ◽  
Author(s):  
E. Schimmerling ◽  
J. R. Steel

In this paper, we solve the strong uniqueness problem posed in [St2]. That is, we extend the full fine structure theory of [MiSt] to backgrounded models all of whose levels are tame (defined in [St2] and below). As a consequence, more powerful large cardinal properties reflect to fine structural inner models. For example, we get the following extension to [MiSt, Theorem 11.3] and [St2, Theorem 0.3].Suppose that there is a strong cardinal that is a limit of Woodin cardinals. Then there is a good extender sequence such that(1) every level of is a sound, tame mouse, and(2) ⊨ “There is a strong cardinal that is a limit of Woodin cardinals”.Recall that satisfies GCH if all its levels are sound. Another consequence of our work is the following covering property, an extension to [St1, Theorem 1.4] and [St3, Theorem 1.10].Suppose that fi is a normal measure on Ω and that all premice are tame. Then Kc, the background certified core model, exists and is a premouse of height Ω. Moreover, for μ-almost every α < Ω.Ideas similar to those introduced here allow us to extend the fine structure theory of [Sch] to the level of tame mice. The details of this extension shall appear elsewhere. From the extension of [Sch] and Theorem 0.2, new relative consistency results follow. For example, we have the following application.If there is a cardinal κ such that κ is κ+-strongly compact, then there is a premouse that is not tame.


1994 ◽  
Vol 59 (4) ◽  
pp. 1420-1432 ◽  
Author(s):  
P. D. Welch

AbstractA small large cardinal upper bound in V for proving when certain subsets of ω1 (including the universally Baire subsets) are precisely those constructible from a real is given. In the core model we find an exact equivalence in terms of the length of the mouse order; we show that ∀B ⊆ ω1 [B is universally Baire ⇔ B ϵ L[r] for some real r] is preserved under set-sized forcing extensions if and only if there are arbitrarily large “admissibly measurable” cardinals.


1984 ◽  
Vol 49 (4) ◽  
pp. 1198-1204 ◽  
Author(s):  
Peter Koepke

A subset X of a structure S is called free in S if ∀x ∈ Xx ∉ S[X − {x}]; here, S[Y] is the substructure of S generated from Y by the functions of S. For κ, λ, μ cardinals, let Frμ(κ, λ) be the assertion:for every structure S with κ ⊂ S which has at most μ functions and relations there is a subset X ⊂ κ free in S of cardinality ≥ λ.We show that Frω(ωω, ω), the free-subset property for ωω, is equiconsistent with the existence of a measurable cardinal (2.2,4.4). This answers a question of Devlin [De].In the first section of this paper we prove some combinatorial facts about Frμ(κ, λ); in particular the first cardinal κ such that Frω(κ, ω) is weakly inaccessible or of cofinality ω (1.2). The second section shows that, under Frω(ωω, ω), ωω is measurable in an inner model. For the convenience of readers not acquainted with the core model κ, we first deduce the existence of 0# (2.1) using the inner model L. Then we adapt the proof to the core model and obtain that ωω is measurable in an inner model. For the reverse direction, we essentially apply a construction of Shelah [Sh] who forced Frω(ωω, ω) over a ground model which contains an ω-sequence of measurable cardinals. We show in §4 that indeed a coherent sequence of Ramsey cardinals suffices. In §3 we obtain such a sequence as an endsegment of a Prikry sequence.


2005 ◽  
Vol 70 (2) ◽  
pp. 557-572
Author(s):  
Andrés Eduardo Caicedo

AbstractIn the absence of Woodin cardinals, fine structural inner models for mild large cardinal hypotheses admit forcing extensions where bounded forcing axioms hold and yet the reals are projectively well-ordered.


1999 ◽  
Vol 5 (2) ◽  
pp. 264-272 ◽  
Author(s):  
Joel David Hamkins

AbstractThe Lévy-Solovay Theorem[8] limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that many of the forcing iterations most commonly found in the large cardinal literature create no new weakly compact cardinals, measurable cardinals, strong cardinals, Woodin cardinals, strongly compact cardinals, supercompact cardinals, almost huge cardinals, huge cardinals, and so on.


2008 ◽  
Vol 73 (2) ◽  
pp. 369-390 ◽  
Author(s):  
J. R. Steel

In this note we shall proveTheorem 0.1. Letbe a countably ω-iterable-mouse which satisfies AD, and [α, β] a weak gap of. Supposeis captured by mice with iteration strategies in ∣α. Let n be least such that ; then we have that believes that has the Scale Property.This complements the work of [5] on the construction of scales of minimal complexity on sets of reals in K(ℝ). Theorem 0.1 was proved there under the stronger hypothesis that all sets definable over are determined, although without the capturing hypothesis. (See [5, Theorem 4.14].) Unfortunately, this is more determinacy than would be available as an induction hypothesis in a core model induction. The capturing hypothesis, on the other hand, is available in such a situation. Since core model inductions are one of the principal applications of the construction of optimal scales, it is important to prove 0.1 as stated.Our proof will incorporate a number of ideas due to Woodin which figure prominently in the weak gap case of the core model induction. It relies also on the connection between scales and iteration strategies with the Dodd-Jensen property first discovered in [3]. Let be the pointclass at the beginning of the weak gap referred to in 0.1. In section 1, we use Woodin's ideas to construct a Γ-full a mouse having ω Woodin cardinals cofinal in its ordinals, together with an iteration strategy Σ which condenses well in the sense of [4, Def. 1.13]. In section 2, we construct the desired scale from and Σ.


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.


2011 ◽  
Vol 76 (2) ◽  
pp. 519-540 ◽  
Author(s):  
Victoria Gitman

AbstractOne of the numerous characterizations of a Ramsey cardinal κ involves the existence of certain types of elementary embeddings for transitive sets of size κ satisfying a large fragment of ZFC. We introduce new large cardinal axioms generalizing the Ramsey elementary embeddings characterization and show that they form a natural hierarchy between weakly compact cardinals and measurable cardinals. These new axioms serve to further our knowledge about the elementary embedding properties of smaller large cardinals, in particular those still consistent with V = L.


2011 ◽  
Vol 76 (2) ◽  
pp. 541-560 ◽  
Author(s):  
Victoria Gitman ◽  
P. D. Welch

AbstractThis paper continues the study of the Ramsey-like large cardinals introduced in [5] and [14]. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such embeddings are fully iterable and so it is natural to ask about large cardinal notions asserting the existence of ultrafilters allowing only α-many iterations for some countable ordinal α. Here we study such α-iterable cardinals. We show that the α-iterable cardinals form a strict hierarchy for α ≤ ω1, that they are downward absolute to L for , and that the consistency strength of Schindler's remarkable cardinals is strictly between 1-iterable and 2-iterable cardinals.We show that the strongly Ramsey and super Ramsey cardinals from [5] are downward absolute to the core model K. Finally, we use a forcing argument from a strongly Ramsey cardinal to separate the notions of Ramsey and virtually Ramsey cardinals. These were introduced in [14] as an upper bound on the consistency strength of the Intermediate Chang's Conjecture.


Sign in / Sign up

Export Citation Format

Share Document