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