Archives
Keywords
Postprocessing function Coherent tree OCA L-space weak diamond Weakly compact cardinal club_AD stick Square-Brackets Partition Relations Club Guessing very good scale Local Club Condensation. 54G20 Fodor-type reflection Martin's Axiom stationary hitting Partition Relations Ascent Path Dushnik-Miller incompactness Axiom R Absoluteness Dowker space super-Souslin tree Nonspecial tree perfectly normal reflection principles Well-behaved magma Uniformly homogeneous Fast club O-space Subnormal ideal weak Kurepa tree P-Ideal Dichotomy AIM forcing coloring number Successor of Regular Cardinal SNR Generalized Clubs Closed coloring Open Access Singular cofinality Knaster and friends Microscopic Approach Small forcing b-scale Foundations Luzin set Poset GMA polarized partition relation diamond star Countryman line countably metacompact regressive Souslin tree Reduced Power Constructible Universe Kurepa Hypothesis Slim tree Knaster Uniformly coherent Mandelbrot set higher Baire space Analytic sets xbox unbounded function Erdos-Hajnal graphs C-sequence tensor product graph Singular cardinals combinatorics stationary reflection Singular Density Aronszajn tree projective Boolean algebra Selective Ultrafilter PFA(S)[S] Uniformization Jonsson cardinal Monotonically far Prevalent singular cardinals Whitehead Problem strongly bounded groups Cardinal function Was Ulam right? free Souslin tree Distributive tree Strongly compact cardinal Cohen real transformations Intersection model PFA Commutative cancellative semigroups Precaliber Cardinal Invariants Rado's conjecture Lipschitz reduction S-Space Minimal Walks Ramsey theory over partitions Shelah's Strong Hypothesis Iterated forcing Diamond Antichain Strongly Luzin set Successor of Singular Cardinal nonmeager set Vanishing levels Ostaszewski square Almost countably chromatic square principles Rainbow sets weak square Forcing with side conditions Strong coloring Ineffable cardinal Amenable C-sequence Entangled linear order approachability ideal Filter reflection indecomposable filter Chang's conjecture Diamond for trees Forcing Axioms middle diamond Respecting tree HOD Hindman's Theorem Greatly Mahlo ccc sap Large Cardinals Sierpinski's onto mapping principle Forcing Prikry-type forcing free Boolean algebra ZFC construction Almost-disjoint family specializable Souslin tree Sakurai's Bell inequality Universal Sequences Non-saturation Almost Souslin Partition relations for trees Diamond-sharp Ascending path Subadditive Hedetniemi's conjecture Interval topology on trees Commutative projection system Rock n' Roll square Ulam matrix Subtle tree property Parameterized proxy principle Reflecting stationary set Chromatic number Souslin Tree Sigma-Prikry Hereditarily Lindelöf space Erdos Cardinal full tree Generalized descriptive set theory Subtle cardinal positive partition relation Fat stationary set
Tag Archives: Sigma-Prikry
Sigma-Prikry forcing III: Down to Aleph_omega
Joint work with Alejandro Poveda and Dima Sinapova. Abstract. We prove the consistency of the failure of the singular cardinals hypothesis at $\aleph_\omega$ together with the reflection of all stationary subsets of $\aleph_{\omega+1}$. This shows that two classical results of … Continue reading
Sigma-Prikry forcing II: Iteration Scheme
Joint work with Alejandro Poveda and Dima Sinapova. Abstract. In Part I of this series, we introduced a class of notions of forcing which we call $\Sigma$-Prikry, and showed that many of the known Prikry-type notions of forcing that centers … Continue reading
Sigma-Prikry forcing I: The Axioms
Joint work with Alejandro Poveda and Dima Sinapova. Abstract. We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality … Continue reading
