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