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