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

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

# Author Archives: Assaf Rinot

## A forcing axiom deciding the generalized Souslin Hypothesis

Joint work with Chris Lambie-Hanson. Abstract. We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, … Continue reading

Posted in Preprints, Souslin Hypothesis
Tagged 03E05, 03E35, 03E57, Diamond, Forcing Axioms, Souslin Tree, square, super-Souslin tree
Leave a comment

## 6th European Set Theory Conference, July 2017

I gave a 3-lectures tutorial at the 6th European Set Theory Conference in Budapest, July 2017. Title: Strong colorings and their applications. Abstract. Consider the following questions. Is the product of two $\kappa$-cc partial orders again $\kappa$-cc? Does there exist … Continue reading

Posted in Invited Talks, Open Problems
Tagged b-scale, Cohen real, Luzin set, Minimal Walks, Souslin Tree, Square-Brackets Partition Relations
4 Comments

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

## ASL North American Meeting, March 2017

I gave a plenary talk at the 2017 ASL North American Meeting in Boise, March 2017. Talk Title: The current state of the Souslin problem. Abstract: Recall that the real line is that unique separable, dense linear ordering with no endpoints in … Continue reading

## MFO workshop in Set Theory, February 2017

I gave an invited talk at the Set Theory workshop in Obwerwolfach, February 2017. Talk Title: Coloring vs. Chromatic. Abstract: In a joint work with Chris Lambie-Hanson, we study the interaction between compactness for the chromatic number (of graphs) and … Continue reading

Posted in Invited Talks
Tagged Chromatic number, coloring number, incompactness, stationary reflection
Leave a comment

## The eightfold way

Joint work with James Cummings, Sy-David Friedman, Menachem Magidor, and Dima Sinapova. Abstract. Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing … 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

## Set Theory and its Applications in Topology, September 2016

I gave an invited talk at the Set Theory and its Applications in Topology meeting, Oaxaca, September 11-16, 2016. The talk was on the $\aleph_2$-Souslin problem. If you are interested in seeing the effect of a jet lag, the video is … Continue reading

## Strong failures of higher analogs of Hindman’s Theorem

Joint work with David J. Fernández Bretón. Abstract. We show that various analogs of Hindman’s Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1. There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that … Continue reading

## More notions of forcing add a Souslin tree

Joint work with Ari Meir Brodsky. Abstract. An $\aleph_1$-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But 15 years after Tennenbaum and independently Jech devised notions of forcing for introducing … Continue reading