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