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