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