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