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