Archives
Keywords
Was Ulam right? Sakurai's Bell inequality Vanishing levels Chromatic number Hedetniemi's conjecture Postprocessing function Jonsson cardinal indecomposable ultrafilter Mandelbrot set Hereditarily Lindelöf space higher Baire space AIM forcing stationary reflection Club Guessing Rock n' Roll Shelah's Strong Hypothesis Iterated forcing Reflecting stationary set Slim tree transformations Reduced Power weak Kurepa tree Cohen real Rainbow sets Almost-disjoint family Minimal Walks Ulam matrix Generalized Clubs Fodor-type reflection middle diamond Whitehead Problem Respecting tree Absoluteness Commutative cancellative semigroups Generalized descriptive set theory Prevalent singular cardinals Diamond Square-Brackets Partition Relations stick ccc Constructible Universe Countryman line unbounded function Knaster Cardinal Invariants Non-saturation Analytic sets Fast club Erdos Cardinal Poset Prikry-type forcing HOD free Souslin tree PFA(S)[S] coloring number Filter reflection Fat stationary set GMA Diamond for trees Partition Relations Weakly compact cardinal Antichain Forcing Greatly Mahlo Coherent tree b-scale Sigma-Prikry Aronszajn tree Souslin Tree 54G20 Erdos-Hajnal graphs Uniformization Microscopic Approach Amenable C-sequence Ascent Path Strongly compact cardinal Local Club Condensation. weak diamond Singular Density free Boolean algebra Strong coloring Small forcing ZFC construction approachability ideal projective Boolean algebra specializable Souslin tree Luzin set countably metacompact Rado's conjecture Ostaszewski square Distributive tree Closed coloring SNR sap S-Space Martin's Axiom Subnormal ideal Diamond-sharp O-space P-Ideal Dichotomy Commutative projection system Kurepa Hypothesis nonmeager set Subadditive Open Access Parameterized proxy principle Foundations positive partition relation xbox Dushnik-Miller stationary hitting Hindman's Theorem Well-behaved magma Almost countably chromatic Singular cardinals combinatorics Successor of Singular Cardinal Ramsey theory over partitions full tree incompactness weak square Strongly Luzin set Intersection model Ineffable cardinal L-space Dowker space diamond star Uniformly coherent OCA Successor of Regular Cardinal very good scale super-Souslin tree Knaster and friends Forcing Axioms strongly bounded groups Universal Sequences Lipschitz reduction Axiom R Subtle cardinal Almost Souslin polarized partition relation Cardinal function regressive Souslin tree tensor product graph Uniformly homogeneous Singular cofinality Selective Ultrafilter reflection principles square principles Subtle tree property PFA Precaliber C-sequence Large Cardinals square Chang's conjecture Sierpinski's onto mapping principle club_AD Nonspecial tree
Tag Archives: Postprocessing function
Winter School in Abstract Analysis, January 2023
I gave a 3-lecture tutorial at the Winter School in Abstract Analysis in Steken, January 2023. Title: Club guessing Abstract. Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove … Continue reading
A microscopic approach to Souslin-tree constructions. Part II
Joint work with Ari Meir Brodsky. Abstract. In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known
11th Young Set Theory Workshop, June 2018
I gave a 4-lecture tutorial at the 11th Young Set Theory Workshop, Lausanne, June 2018. Title: In praise of C-sequences. Abstract. Ulam and Solovay showed that any stationary set may be split into two. Is it also the case that … Continue reading
Posted in Invited Talks
Tagged Aronszajn tree, C-sequence, incompactness, Knaster, Minimal Walks, Postprocessing function, square
Leave a comment
A remark on Schimmerling’s question
Joint work with Ari Meir Brodsky. Abstract. Schimmerling asked whether
The 14th International Workshop on Set Theory in Luminy, October 2017
I gave an invited talk at the 14th International Workshop on Set Theory in Luminy in Marseille, October 2017. Talk Title: Distributive Aronszajn trees Abstract: It is well-known that that the statement “all
Distributive Aronszajn trees
Joint work with Ari Meir Brodsky. Abstract. Ben-David and Shelah proved that if
Reflection on the coloring and chromatic numbers
Joint work with Chris Lambie-Hanson. Abstract. We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Chang's conjecture, Chromatic number, coloring number, Fodor-type reflection, incompactness, Iterated forcing, Parameterized proxy principle, Postprocessing function, Rado's conjecture, square, stationary reflection
2 Comments
