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