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