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