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