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