Archives
Keywords
sap Fat stationary set ZFC construction Luzin set HOD Subtle tree property Uniformly homogeneous Reflecting stationary set Chang's conjecture Uniformly coherent Diamond Parameterized proxy principle Generalized Clubs Ulam matrix unbounded function Club Guessing Distributive tree Kurepa Hypothesis GMA Almost countably chromatic Axiom R Strongly compact cardinal projective Boolean algebra Coherent tree Aronszajn tree C-sequence Commutative cancellative semigroups L-space Local Club Condensation. very good scale PFA(S)[S] diamond star Non-saturation Diamond for trees super-Souslin tree Closed coloring Ascent Path xbox positive partition relation PFA Was Ulam right? Cardinal Invariants Knaster and friends Whitehead Problem Small forcing Prevalent singular cardinals Lipschitz reduction free Souslin tree Sierpinski's onto mapping principle Hedetniemi's conjecture Rainbow sets Rado's conjecture Martin's Axiom Sakurai's Bell inequality Fast club P-Ideal Dichotomy specializable Souslin tree Souslin Tree Sigma-Prikry strongly bounded groups weak square stationary hitting Slim tree ccc Ineffable cardinal Strongly Luzin set Poset Ramsey theory over partitions Subtle cardinal Jonsson cardinal coloring number incompactness Rock n' Roll nonmeager set Nonspecial tree O-space Ostaszewski square Subnormal ideal middle diamond Open Access square Successor of Singular Cardinal Forcing Axioms Precaliber Singular cardinals combinatorics Cardinal function Strong coloring approachability ideal polarized partition relation Selective Ultrafilter Generalized descriptive set theory Universal Sequences Well-behaved magma S-Space countably metacompact Respecting tree Erdos-Hajnal graphs SNR Singular Density square principles Antichain stationary reflection Minimal Walks weak Kurepa tree 54G20 Vanishing levels Analytic sets club_AD Filter reflection full tree Chromatic number Commutative projection system Foundations Subadditive stick Fodor-type reflection Postprocessing function Erdos Cardinal Almost Souslin Knaster Countryman line indecomposable ultrafilter Amenable C-sequence Diamond-sharp Forcing Greatly Mahlo free Boolean algebra Intersection model Shelah's Strong Hypothesis OCA Almost-disjoint family transformations higher Baire space Prikry-type forcing Iterated forcing weak diamond tensor product graph AIM forcing reflection principles Hindman's Theorem regressive Souslin tree Hereditarily Lindelöf space Dowker space b-scale Singular cofinality Uniformization Square-Brackets Partition Relations Partition Relations Cohen real Constructible Universe Dushnik-Miller Reduced Power Microscopic Approach Weakly compact cardinal Absoluteness Mandelbrot set Large Cardinals Successor of Regular Cardinal
Tag Archives: weak Kurepa tree
Diamond on Kurepa trees
Joint work with Ziemek Kostana and Saharon Shelah. Abstract. We introduce a new weak variation of diamond that is meant to only guess the branches of a Kurepa tree. We demonstrate that this variation is considerably weaker than diamond by … Continue reading
Posted in Preprints, Squares and Diamonds
Tagged Diamond, Diamond for trees, Iterated forcing, Kurepa Hypothesis, weak Kurepa tree
1 Comment
Sums of triples in Abelian groups
Joint work with Ido Feldman. Abstract. Motivated by a problem in additive Ramsey theory, we extend Todorcevic’s partitions of three-dimensional combinatorial cubes to handle additional three-dimensional objects. As a corollary, we get that if the continuum hypothesis fails, then for … Continue reading
