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