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