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