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