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