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