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