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