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