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