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