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