### Archives

### Recent blog posts

- Prikry forcing may add a Souslin tree June 12, 2016
- The reflection principle $R_2$ May 20, 2016
- Prolific Souslin trees March 17, 2016
- Generalizations of Martin’s Axiom and the well-met condition January 11, 2015
- Many diamonds from just one January 6, 2015
- Happy new jewish year! September 24, 2014
- Square principles April 19, 2014
- Partitioning the club guessing January 22, 2014

### Keywords

Club Guessing Cohen real Luzin set Rado's conjecture middle diamond super-Souslin tree Rainbow sets Kurepa Hypothesis Poset 05A17 Hindman's Theorem Distributive tree Prikry-type forcing Whitehead Problem tensor product graph Reduced Power Universal Sequences Martin's Axiom Slim tree Commutative cancellative semigroups Selective Ultrafilter Diamond Weakly compact cardinal Cardinal Invariants Cardinal function Successor of Singular Cardinal Microscopic Approach Rock n' Roll Aronszajn tree Almost-disjoint famiy Jonsson cardinal ccc Prevalent singular cardinals P-Ideal Dichotomy Erdos Cardinal Constructible Universe PFA Forcing Axioms Antichain Coherent tree square Axiom R Large Cardinals Hedetniemi's conjecture PFA(S)[S] Sakurai's Bell inequality Fat stationary set xbox very good scale Singular cardinals combinatorics Absoluteness Partition Relations Forcing Hereditarily Lindelöf space weak square Almost Souslin sap 20M14 coloring number Souslin Tree Singular Density Singular coﬁnality Successor of Regular Cardinal reflection principles Uniformization Chang's conjecture Generalized Clubs L-space Chromatic number Ascent Path Foundations Ostaszewski square diamond star Shelah's Strong Hypothesis Small forcing Stevo Todorcevic incompactness Square-Brackets Partition Relations Nonspecial tree stationary hitting Postprocessing function S-Space free Boolean algebra approachability ideal polarized partition relation Mandelbrot set Fodor-type reflection OCA Knaster projective Boolean algebra Minimal Walks b-scale square principles stationary reflection Fast club HOD Dushnik-Miller weak diamond Parameterized proxy principle Erdos-Hajnal graphs 11P99 Non-saturation Almost countably chromatic Uniformly coherent

# Tag Archives: Postprocessing function

## The 14th International Workshop on Set Theory in Luminy

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

Posted in Invited Talks, Squares and Diamonds
Tagged Aronszajn tree, Postprocessing function
Leave a comment

## 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