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