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