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