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