Archives
Keywords
Interval topology on trees higher Baire space Constructible Universe HOD Subnormal ideal SNR Dushnik-Miller Postprocessing function strongly bounded groups Closed coloring Diamond-sharp Entangled linear order Coherent tree Erdos Cardinal Selective Ultrafilter ccc Precaliber Erdos-Hajnal graphs Uniformly coherent Whitehead Problem Fodor-type reflection Sigma-Prikry Strongly compact cardinal approachability ideal Diamond for trees super-Souslin tree stationary reflection Fat stationary set Sierpinski's onto mapping principle Countryman line Singular Density weak diamond sap specializable Souslin tree Cardinal function Nonspecial tree L-space Filter reflection GMA Almost countably chromatic projective Boolean algebra 54G20 Amenable C-sequence unbounded function stationary hitting Open Access Fast club Ramsey theory over partitions incompactness Successor of Singular Cardinal Singular cardinals combinatorics Ulam matrix Weakly compact cardinal tensor product graph regressive Souslin tree Reduced Power Subadditive Foundations Strongly Luzin set Diamond square Parameterized proxy principle Chang's conjecture Uniformly homogeneous Iterated forcing Ineffable cardinal Cohen real Prikry-type forcing Ascending path nonmeager set Antichain Knaster polarized partition relation Almost Souslin Successor of Regular Cardinal Uniformization Distributive tree coloring number Forcing Axioms Shelah's Strong Hypothesis Chromatic number C-sequence Commutative cancellative semigroups Dowker space Subtle tree property xbox Hereditarily Lindelöf space Vanishing levels Lipschitz reduction Square-Brackets Partition Relations OCA Local Club Condensation. Subtle cardinal Rainbow sets Non-saturation AIM forcing b-scale Analytic sets middle diamond S-Space Rado's conjecture countably metacompact O-space Hedetniemi's conjecture Universal Sequences Ascent Path Aronszajn tree Cardinal Invariants Ostaszewski square indecomposable filter Small forcing Intersection model Microscopic Approach stick Prevalent singular cardinals Club Guessing very good scale full tree Slim tree Forcing with side conditions PFA(S)[S] transformations Hindman's Theorem positive partition relation Luzin set ZFC construction Commutative projection system Generalized Clubs free Souslin tree Respecting tree Minimal Walks P-Ideal Dichotomy Almost-disjoint family Poset Singular cofinality Knaster and friends Sakurai's Bell inequality club_AD Large Cardinals Forcing PFA diamond star Souslin Tree free Boolean algebra Partition Relations weak Kurepa tree weak square Monotonically far Greatly Mahlo Kurepa Hypothesis Well-behaved magma Jonsson cardinal Was Ulam right? Absoluteness Mandelbrot set reflection principles Strong coloring square principles Martin's Axiom Rock n' Roll Generalized descriptive set theory perfectly normal Reflecting stationary set Axiom R
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
