### Archives

### Recent blog posts

- Prikry forcing may add a Souslin tree June 12, 2016
- The reflection principle $R_2$ May 20, 2016
- Prolific Souslin trees March 17, 2016
- Generalizations of Martin’s Axiom and the well-met condition January 11, 2015
- Many diamonds from just one January 6, 2015
- Happy new jewish year! September 24, 2014
- Square principles April 19, 2014
- Partitioning the club guessing January 22, 2014

### Keywords

approachability ideal Uniformization Minimal Walks Cardinal function diamond star Martin's Axiom Postprocessing function Jonsson cardinal Prevalent singular cardinals 05A17 Successor of Singular Cardinal Dushnik-Miller Chromatic number Almost Souslin PFA Forcing Axioms Large Cardinals stationary reflection Antichain 20M14 Aronszajn tree S-Space Square-Brackets Partition Relations polarized partition relation Fodor-type reflection L-space Whitehead Problem Forcing 11P99 Distributive tree Coherent tree Generalized Clubs Diamond Mandelbrot set HOD square PFA(S)[S] stationary hitting Absoluteness middle diamond b-scale Chang's conjecture Stevo Todorcevic Rainbow sets OCA Nonspecial tree sap Small forcing coloring number weak square Selective Ultrafilter Axiom R ccc Ostaszewski square Knaster projective Boolean algebra Hindman's Theorem Singular coﬁnality Slim tree Constructible Universe Reduced Power Prikry-type forcing Successor of Regular Cardinal Hedetniemi's conjecture Poset Rock n' Roll Ascent Path Microscopic Approach Club Guessing incompactness Weakly compact cardinal P-Ideal Dichotomy Kurepa Hypothesis Hereditarily Lindelöf space Parameterized proxy principle Erdos Cardinal xbox Singular cardinals combinatorics Non-saturation Uniformly coherent Singular Density Sakurai's Bell inequality Commutative cancellative semigroups reflection principles weak diamond very good scale Fat stationary set Almost-disjoint famiy Erdos-Hajnal graphs Cardinal Invariants Partition Relations Souslin Tree Rado's conjecture Fast club Almost countably chromatic tensor product graph Foundations Universal Sequences Shelah's Strong Hypothesis square principles free Boolean algebra Cohen real 05D10

# Tag Archives: Distributive tree

## 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