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