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