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