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

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

# 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