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