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