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