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