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