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