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