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