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