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