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