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