Archives
Keywords
Reduced Power ccc Fast club square principles Chromatic number Generalized Clubs Forcing Countryman line C-sequence Kurepa Hypothesis L-space unbounded function stationary hitting Singular cardinals combinatorics weak diamond Amenable C-sequence ZFC construction coloring number projective Boolean algebra Almost Souslin b-scale Postprocessing function SNR P-Ideal Dichotomy Uniformization Commutative projection system Prevalent singular cardinals Ascent Path PFA(S)[S] club_AD Greatly Mahlo Almost-disjoint family Ineffable cardinal very good scale Souslin Tree Constructible Universe super-Souslin tree Precaliber Antichain Martin's Axiom HOD free Souslin tree Local Club Condensation. Erdos-Hajnal graphs Almost countably chromatic Uniformly homogeneous reflection principles Analytic sets Small forcing positive partition relation Cohen real Whitehead Problem Open Access stationary reflection indecomposable ultrafilter Diamond nonmeager set Generalized descriptive set theory Cardinal function transformations Absoluteness Club Guessing Poset approachability ideal diamond star Hedetniemi's conjecture Sierpinski's onto mapping principle GMA weak Kurepa tree Ulam matrix Subnormal ideal Mandelbrot set Subadditive sap Dowker space Knaster and friends strongly bounded groups Hindman's Theorem PFA Rado's conjecture Nonspecial tree Non-saturation OCA 54G20 Subtle tree property Fodor-type reflection Prikry-type forcing xbox Aronszajn tree Singular Density Parameterized proxy principle Strongly Luzin set Forcing Axioms Successor of Regular Cardinal Selective Ultrafilter Filter reflection Singular cofinality full tree Knaster Diamond for trees free Boolean algebra Fat stationary set Chang's conjecture Well-behaved magma middle diamond polarized partition relation countably metacompact Square-Brackets Partition Relations Vanishing levels weak square Foundations Intersection model Luzin set Weakly compact cardinal Rainbow sets Large Cardinals Universal Sequences O-space Strong coloring Slim tree Coherent tree Was Ulam right Strongly compact cardinal Iterated forcing Partition Relations Distributive tree Respecting tree Reflecting stationary set square Commutative cancellative semigroups Diamond-sharp Uniformly coherent Rock n' Roll stick Ostaszewski square Cardinal Invariants Sigma-Prikry Subtle cardinal Hereditarily Lindelöf space S-Space higher Baire space AIM forcing Axiom R Successor of Singular Cardinal Shelah's Strong Hypothesis Ramsey theory over partitions regressive Souslin tree Minimal Walks Sakurai's Bell inequality Dushnik-Miller Jonsson cardinal tensor product graph Closed coloring Erdos Cardinal Microscopic Approach specializable Souslin tree Lipschitz reduction incompactness
Tag Archives: very good scale
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
4th Arctic Set Theory Workshop, January 2019
I gave an invited talk at the Arctic Set Theory Workshop 4 in Kilpisjärvi, January 2019. Talk Title: Splitting a stationary set: Is there another way? Abstract: Motivated by a problem in pcf theory, we seek for a new way … Continue reading
Posted in Invited Talks
Tagged Club Guessing, Reflecting stationary set, Ulam matrix, very good scale
Comments Off on 4th Arctic Set Theory Workshop, January 2019
The failure of diamond on a reflecting stationary set
Joint work with Moti Gitik. Abstract: It is shown that the failure of $\diamondsuit_S$, for a subset $S\subseteq\aleph_{\omega+1}$ that reflects stationarily often, is consistent with GCH and $\text{AP}_{\aleph_\omega}$, relatively to the existence of a supercompact cardinal. This should be comapred with … Continue reading
