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