Archives
Keywords
Sigma-Prikry Was Ulam right? coloring number 54G20 reflection principles Precaliber Square-Brackets Partition Relations Nonspecial tree Generalized descriptive set theory Generalized Clubs Successor of Singular Cardinal Uniformly homogeneous tensor product graph Erdos Cardinal Ineffable cardinal square principles full tree Almost Souslin Strongly Luzin set Knaster and friends Cardinal function super-Souslin tree Antichain Poset stationary hitting indecomposable ultrafilter Rado's conjecture Strong coloring Reflecting stationary set diamond star Lipschitz reduction regressive Souslin tree Fat stationary set Vanishing levels Diamond for trees Rainbow sets OCA higher Baire space Jonsson cardinal Knaster Chromatic number Diamond specializable Souslin tree Subadditive Weakly compact cardinal Uniformization ZFC construction Iterated forcing Diamond-sharp Subnormal ideal square Distributive tree free Boolean algebra Hedetniemi's conjecture Forcing Greatly Mahlo Axiom R Singular cardinals combinatorics Strongly compact cardinal b-scale middle diamond Fast club SNR Coherent tree Non-saturation Hereditarily Lindelöf space Uniformly coherent Almost countably chromatic Selective Ultrafilter Kurepa Hypothesis Subtle tree property Reduced Power Small forcing Prikry-type forcing Dowker space Chang's conjecture countably metacompact HOD Sierpinski's onto mapping principle Mandelbrot set Rock n' Roll Erdos-Hajnal graphs Singular Density Whitehead Problem strongly bounded groups Ramsey theory over partitions Ostaszewski square polarized partition relation Absoluteness Fodor-type reflection Filter reflection L-space stationary reflection ccc Forcing Axioms Souslin Tree GMA Prevalent singular cardinals Partition Relations Almost-disjoint family Cohen real Ulam matrix Club Guessing Slim tree AIM forcing approachability ideal Countryman line P-Ideal Dichotomy Constructible Universe Well-behaved magma weak diamond incompactness sap Shelah's Strong Hypothesis Analytic sets Foundations Amenable C-sequence unbounded function Respecting tree nonmeager set Aronszajn tree transformations free Souslin tree Parameterized proxy principle very good scale Sakurai's Bell inequality C-sequence Universal Sequences Ascent Path O-space Large Cardinals Closed coloring Microscopic Approach projective Boolean algebra Subtle cardinal Luzin set PFA xbox Martin's Axiom PFA(S)[S] Successor of Regular Cardinal Open Access positive partition relation weak square Dushnik-Miller Intersection model Commutative cancellative semigroups Minimal Walks Hindman's Theorem Singular cofinality club_AD stick weak Kurepa tree S-Space Commutative projection system Postprocessing function Local Club Condensation. Cardinal Invariants
Tag Archives: Ramsey theory over partitions
Ramsey theory over partitions II: Negative Ramsey relations and pump-up theorems
Joint work with Menachem Kojman and Juris Steprāns. Abstract. In this series of papers, we advance Ramsey theory of colorings over partitions. In this part, we concentrate on anti-Ramsey relations, or, as they are better known, strong colorings, and in … Continue reading
Ramsey theory over partitions III: Strongly Luzin sets and partition relations
Joint work with Menachem Kojman and Juris Steprāns. Abstract. The strongest type of coloring of pairs of countable ordinals, gotten by Todorcevic from a strongly Luzin set, is shown to be equivalent to the existence of a nonmeager set of … Continue reading
Ramsey theory over partitions I: Positive Ramsey relations from forcing axioms
Joint work with Menachem Kojman and Juris Steprāns. Abstract. In this series of papers, we advance Ramsey theory of colorings over partitions. In this part, a correspondence between anti-Ramsey properties of partitions and chain conditions of the natural forcing notions … Continue reading
Posted in Partition Relations, Publications
Tagged 03E02, 03E17, 03E35, GMA, Martin's Axiom, positive partition relation, Ramsey theory over partitions
1 Comment
