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