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