Contributions to the Theory of Large Cardinals through the Method of Forcing

Bulletin of Symbolic Logic 27 (2):221-222 (2021)
  Copy   BIBTEX

Abstract

The 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. In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics.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^{}$ -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 “ $^{\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 $^{\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 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 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.

Links

PhilArchive



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

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

Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Proper forcing and remarkable cardinals II.Ralf-Dieter Schindler - 2001 - Journal of Symbolic Logic 66 (3):1481-1492.
Proper forcing and l(ℝ).Itay Neeman & Jindřich Zapletal - 2001 - Journal of Symbolic Logic 66 (2):801-810.
Proper Forcing and L$$.Itay Neeman & Jindrich Zapletal - 2001 - Journal of Symbolic Logic 66 (2):801-810.
A Cardinal Pattern Inspired by AD.Arthur W. Apter - 1996 - Mathematical Logic Quarterly 42 (1):211-218.
On extendible cardinals and the GCH.Konstantinos Tsaprounis - 2013 - Archive for Mathematical Logic 52 (5-6):593-602.
Chains of end elementary extensions of models of set theory.Andrés Villaveces - 1998 - Journal of Symbolic Logic 63 (3):1116-1136.
Tall cardinals.Joel D. Hamkins - 2009 - Mathematical Logic Quarterly 55 (1):68-86.
The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
Chains of End Elementary Extensions of Models of Set Theory.Andres Villaveces - 1998 - Journal of Symbolic Logic 63 (3):1116-1136.
Co-stationarity of the Ground Model.Natasha Dobrinen & Sy-David Friedman - 2006 - Journal of Symbolic Logic 71 (3):1029 - 1043.
Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.

Analytics

Added to PP
2022-11-14

Downloads
16 (#855,572)

6 months
8 (#292,366)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

C(n)-cardinals.Joan Bagaria - 2012 - Archive for Mathematical Logic 51 (3-4):213-240.

Add more references