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