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