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