Archives
Keywords
Square-Brackets Partition Relations reflection principles Partition Relations projective Boolean algebra Jonsson cardinal Filter reflection Was Ulam right? ccc SNR Small forcing AIM forcing GMA super-Souslin tree Commutative cancellative semigroups Almost countably chromatic Ascent Path Prevalent singular cardinals Erdos Cardinal Local Club Condensation. Monotonically far Club Guessing Absoluteness Cardinal function sap Ramsey theory over partitions Fast club Closed coloring Vanishing levels tensor product graph xbox Almost Souslin Open Access Subadditive positive partition relation Strongly Luzin set Parameterized proxy principle Reduced Power full tree Rado's conjecture Minimal Walks Diamond-sharp Large Cardinals Strong coloring Diamond for trees Reflecting stationary set Well-behaved magma Precaliber square Shelah's Strong Hypothesis Forcing Forcing with side conditions stick transformations Subnormal ideal countably metacompact Strongly compact cardinal Lipschitz reduction Analytic sets Respecting tree stationary hitting nonmeager set Non-saturation Dushnik-Miller Generalized Clubs P-Ideal Dichotomy weak square Souslin Tree weak Kurepa tree Rainbow sets free Souslin tree HOD Universal Sequences Diamond Uniformly coherent Fodor-type reflection O-space Hereditarily Lindelöf space Kurepa Hypothesis strongly bounded groups Selective Ultrafilter Singular cardinals combinatorics PFA(S)[S] Subtle cardinal Coherent tree Sakurai's Bell inequality Hedetniemi's conjecture Weakly compact cardinal ZFC construction Commutative projection system coloring number Martin's Axiom Rock n' Roll Cardinal Invariants Sierpinski's onto mapping principle OCA specializable Souslin tree indecomposable filter perfectly normal L-space Chang's conjecture C-sequence Antichain very good scale Foundations Erdos-Hajnal graphs Prikry-type forcing Slim tree Dowker space Uniformization Almost-disjoint family Interval topology on trees Knaster Entangled linear order Distributive tree Postprocessing function Successor of Singular Cardinal polarized partition relation Iterated forcing Aronszajn tree Successor of Regular Cardinal regressive Souslin tree Singular Density Constructible Universe PFA free Boolean algebra Fat stationary set Microscopic Approach unbounded function diamond star Amenable C-sequence Cohen real Whitehead Problem middle diamond approachability ideal Countryman line Sigma-Prikry higher Baire space Singular cofinality Intersection model weak diamond b-scale Luzin set square principles Knaster and friends Ineffable cardinal Uniformly homogeneous Poset Ascending path stationary reflection club_AD Generalized descriptive set theory Ostaszewski square Greatly Mahlo Nonspecial tree Mandelbrot set Forcing Axioms Partition relations for trees S-Space Ulam matrix Hindman's Theorem 54G20 incompactness Subtle tree property Axiom R Chromatic number
Tag Archives: Aronszajn tree
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
11th Young Set Theory Workshop, June 2018
I gave a 4-lecture tutorial at the 11th Young Set Theory Workshop, Lausanne, June 2018. Title: In praise of C-sequences. Abstract. Ulam and Solovay showed that any stationary set may be split into two. Is it also the case that … Continue reading
Posted in Invited Talks
Tagged Aronszajn tree, C-sequence, incompactness, Knaster, Minimal Walks, Postprocessing function, square
Leave a comment
The 14th International Workshop on Set Theory in Luminy, October 2017
I gave an invited talk at the 14th International Workshop on Set Theory in Luminy in Marseille, October 2017. Talk Title: Distributive Aronszajn trees Abstract: It is well-known that that the statement “all $\aleph_1$-Aronszajn trees are special” is consistent with ZFC … Continue reading
Distributive Aronszajn trees
Joint work with Ari Meir Brodsky. Abstract. Ben-David and Shelah proved that if $\lambda$ is a singular strong-limit cardinal and $2^\lambda=\lambda^+$, then $\square^*_\lambda$ entails the existence of a $\lambda$-distributive $\lambda^+$-Aronszajn tree. Here, it is proved that the same conclusion remains … Continue reading
The eightfold way
Joint work with James Cummings, Sy-David Friedman, Menachem Magidor, and Dima Sinapova. Abstract. Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing … Continue reading
Chain conditions of products, and weakly compact cardinals
Abstract. The history of productivity of the $\kappa$-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every … Continue reading
Posted in Partition Relations, Publications
Tagged Aronszajn tree, ccc, Fat stationary set, Minimal Walks, square, Weakly compact cardinal
2 Comments
PFA and the tree property at $\aleph_2$
Recall that a poset $\langle T,\le\rangle$ is said to be a $\lambda^+$-Aronszajn tree, if it isomorphic to a poset $(\mathcal T,\subseteq)$ of the form: $\emptyset\in \mathcal T\subseteq{}^{<\lambda^+}\lambda$; Write $\mathcal T_\alpha:=\{\sigma\in\mathcal T\mid \text{dom}(\sigma)=\alpha\}$; for all $\alpha<\lambda^+$, $\mathcal T_\alpha$ has size $\le\lambda$, … Continue reading
A cofinality-preserving small forcing may introduce a special Aronszajn tree
Extended Abstract: Shelah proved that Cohen forcing introduces a Souslin tree; Jensen proved that a c.c.c. forcing may consistently add a Kurepa tree; Todorcevic proved that a Knaster poset may already force the Kurepa hypothesis; Irrgang introduced a c.c.c. notion … Continue reading
Posted in Publications, Squares and Diamonds
Tagged 03E04, 03E05, 03E35, Aronszajn tree, Small forcing, Successor of Singular Cardinal, weak square
Leave a comment
