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