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