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