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