### Archives

### Recent blog posts

- A strong form of König’s lemma October 21, 2017
- 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

### Keywords

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

# 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