scholarly journals SQUARES AND NARROW SYSTEMS

2017 ◽  
Vol 82 (3) ◽  
pp. 834-859 ◽  
Author(s):  
CHRIS LAMBIE-HANSON

AbstractA narrow system is a combinatorial object introduced by Magidor and Shelah in connection with work on the tree property at successors of singular cardinals. In analogy to the tree property, a cardinalκsatisfies thenarrow system propertyif every narrow system of heightκhas a cofinal branch. In this paper, we study connections between the narrow system property, square principles, and forcing axioms. We prove, assuming large cardinals, both that it is consistent that ℵω+1satisfies the narrow system property and$\square _{\aleph _\omega , < \aleph _\omega } $holds and that it is consistent that every regular cardinal satisfies the narrow system property. We introduce natural strengthenings of classical square principles and show how they can be used to produce narrow systems with no cofinal branch. Finally, we show that the Proper Forcing Axiom implies that every narrow system of countable width has a cofinal branch but is consistent with the existence of a narrow system of width ω1with no cofinal branch.

2014 ◽  
Vol 79 (01) ◽  
pp. 193-207 ◽  
Author(s):  
LAURA FONTANELLA

Abstract An inaccessible cardinal is strongly compact if, and only if, it satisfies the strong tree property. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC where ${\aleph _{\omega + 1}}$ has the strong tree property. Moreover, we prove that every successor of a singular limit of strongly compact cardinals has the strong tree property.


2008 ◽  
Vol 14 (1) ◽  
pp. 99-113
Author(s):  
Matteo Viale

The purpose of this communication is to present some recent advances on the consequences that forcing axioms and large cardinals have on the combinatorics of singular cardinals. I will introduce a few examples of problems in singular cardinal combinatorics which can be fruitfully attacked using ideas and techniques coming from the theory of forcing axioms and then translate the results so obtained in suitable large cardinals properties.The first example I will treat is the proof that the proper forcing axiom PFA implies the singular cardinal hypothesis SCH, this will easily lead to a new proof of Solovay's theorem that SCH holds above a strongly compact cardinal. I will also outline how some of the ideas involved in these proofs can be used as means to evaluate the “saturation” properties of models of strong forcing axioms like MM or PFA.The second example aims to show that the transfer principle (ℵω+1, ℵω) ↠ (ℵ2, ℵ1) fails assuming Martin's Maximum MM. Also in this case the result can be translated in a large cardinal property, however this requires a familiarity with a rather large fragment of Shelah's pcf-theory.Only sketchy arguments will be given, the reader is referred to the forthcoming [25] and [38] for a thorough analysis of these problems and for detailed proofs.


2005 ◽  
Vol 11 (1) ◽  
pp. 51-60
Author(s):  
Justin Tatch Moore

AbstractIn this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of ℝ which is Σ1-definable in (H(ω2), ϵ). Second, the Proper Forcing Axiom implies that the class of uncountable linear orders has a five element basis. The elements are X, ω1, , C, C * where X is any suborder of the reals of size ω1 and C is any Countryman line. Third, the Proper Forcing Axiom implies the Singular Cardinals Hypothesis at k unless stationary subsets of reflect. The techniques are expected to be applicable to other open problems concerning the theory ofH(ω2).


1995 ◽  
Vol 60 (1) ◽  
pp. 58-73 ◽  
Author(s):  
Martin Goldstern ◽  
Saharon Shelah

AbstractThe bounded proper forcing axiom BPFA is the statement that for any family of ℵ1 many maximal antichains of a proper forcing notion, each of size ℵ1, there is a directed set meeting all these antichains.A regular cardinal κ is called ∑1-reflecting, if for any regular cardinal χ, for all formulas φ, “H(χ) ⊨ ‘φ’” implies “∃δ < κ, H(δ) ⊨ ‘φ’”.We investigate several algebraic consequences of BPFA, and we show that the consistency strength of the bounded proper forcing axiom is exactly the existence of a ∑1-reflecting cardinal (which is less than the existence of a Mahlo cardinal).We also show that the question of the existence of isomorphisms between two structures can be reduced to the question of rigidity of a structure.


2004 ◽  
Vol 69 (1) ◽  
pp. 73-80 ◽  
Author(s):  
Sy D. Friedman

In this article we study the strength of absoluteness (with real parameters) in various types of generic extensions, correcting and improving some results from [3]. (In particular, see Theorem 3 below.) We shall also make some comments relating this work to the bounded forcing axioms BMM, BPFA and BSPFA.The statement “ absoluteness holds for ccc forcing” means that if a formula with real parameters has a solution in a ccc set-forcing extension of the universe V, then it already has a solution in V. The analogous definition applies when ccc is replaced by other set-forcing notions, or by class-forcing.Theorem 1. [1] absoluteness for ccc has no strength; i.e., if ZFC is consistent then so is ZFC + absoluteness for ccc.The following results concerning (arbitrary) set-forcing and class-forcing can be found in [3].Theorem 2 (Feng-Magidor-Woodin). (a) absoluteness for arbitrary set-forcing is equiconsistent with the existence of a reflecting cardinal, i.e., a regular cardinal κ such that H(κ) is ∑2-elementary in V.(b) absoluteness for class-forcing is inconsistent.We consider next the following set-forcing notions, which lie strictly between ccc and arbitrary set-forcing: proper, semiproper, stationary-preserving and ω1-preserving. We refer the reader to [8] for the definitions of these forcing notions.Using a variant of an argument due to Goldstern-Shelah (see [6]), we show the following. This result corrects Theorem 2 of [3] (whose proof only shows that if absoluteness holds in a certain proper forcing extension, then in L either ω1 is Mahlo or ω2 is inaccessible).


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.


Sign in / Sign up

Export Citation Format

Share Document