Category Archives: Souslin Hypothesis

Proxy principles in combinatorial set theory

Joint work with Ari Meir Brodsky and Shira Yadai. Abstract. The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not … Continue reading

Posted in Preprints, Souslin Hypothesis | Tagged , , , , , , , | 1 Comment

The vanishing levels of a tree

Joint work with Shira Yadai and Zhixing You. Abstract. We initiate the study of the spectrum $Vspec(\kappa)$ of sets that can be realized as the vanishing levels $V(\mathbf T)$ of a normal $\kappa$-tree $\mathbf T$. The latter is an invariant in … Continue reading

Posted in Preprints, Souslin Hypothesis | Tagged , , , , , , , , | 1 Comment

Full Souslin trees at small cardinals

Joint work with Shira Yadai and Zhixing You. Abstract. A $\kappa$-tree is full if each of its limit levels omits no more than one potential branch. Kunen asked whether a full $\kappa$-Souslin tree may consistently exist. Shelah gave an affirmative … Continue reading

Posted in Preprints, Souslin Hypothesis | Tagged , , , , , , , | 1 Comment

On the ideal J[kappa]

Abstract. Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[\kappa]$, from which we confirm that $\kappa$-Souslin trees exist in various models of interest. As a corollary we … Continue reading

Posted in Publications, Souslin Hypothesis | Tagged , , | 1 Comment

A guessing principle from a Souslin tree, with applications to topology

Joint work with Roy Shalev. Abstract. We introduce a new combinatorial principle which we call $\clubsuit_{AD}$. This principle asserts the existence of a certain multi-ladder system with guessing and almost-disjointness features, and is shown to be sufficient for carrying out … Continue reading

Posted in Publications, Souslin Hypothesis, Topology | Tagged , , , , , , | 2 Comments

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

Posted in Publications, Souslin Hypothesis | Tagged , , , , , , , , | 2 Comments

Souslin trees at successors of regular cardinals

Abstract. We present a weak sufficient condition for the existence of Souslin trees at successor of regular cardinals. The result is optimal and simultaneously improves an old theorem of Gregory and a more recent theorem of the author. Downloads: Citation … Continue reading

Posted in Publications, Souslin Hypothesis | Tagged , | 1 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

Posted in Publications, Souslin Hypothesis | Tagged , , , , , , , , , , | 1 Comment

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 Publications, Souslin Hypothesis | Tagged , , , , , , , | 1 Comment

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

Posted in Publications, Souslin Hypothesis | Tagged , , , , | 2 Comments