Related papers: A guessing principle from a Souslin tree, with app…
It is proved that if there exists a Luzin set, or if either the stick principle or diamond(b) hold, then a strong instance of the guessing principle $\clubsuit_{AD}$ holds at the first uncountable cardinal. In particular, any of the above…
We show it is consistent that there is a Souslin tree $S$ such that after forcing with $S$, $S$ is Kurepa and for all clubs $C \subset \omega_1$, $S\upharpoonright C$ is rigid. This answers Fuchs's questions in Club degrees of rigidity and…
A Souslin algebra is a complete Boolean algebra whose main features are ruled by a tight combination of an antichain condition with an infinite distributive law. The present article divides into two parts. In the first part a representation…
We continue the development of the theory of capturing schemes over $\omega_1$ by analyzing the relation between the capturing construction schemes (whose existence is implied by Jensen's $\Diamond$-principle) and both the Continuum…
The Suslin hypothesis states that there are no nonseparable complete dense linear orderings without endpoints which have the countable chain condition. $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$ proves the Suslin hypothesis. In…
This paper provides an accessible introduction to some of the work of Woodin on suitable extender models. We define the HOD conjecture, prove it is equivalent to a formulation in terms of weak extender models for supercompactness, and give…
We prove that there exists a 0-dimensional, scattered $T_2$ space $X$ such that $X$ is aD but not linearly D, answering a question of Arhangel'skii. The constructions are based on Shelah's club guessing principles.
We prove that for regular $\lambda$ above a strong limit singular $\mu$ certain guessing principles follow just from cardinal arithmetic assumptions. The main result is that for such $\lambda$ and $\mu$ there are coboundedly many regular…
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…
In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…
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.
We give a new proof of the following theorem due to W. Weiss and P. Komjath: if $X$ is a regular topological space, with character $ < \mathfrak{b}$ and $X \rightarrow (top \omega + 1)^{1}_{\omega}$, then, for all $\alpha < \omega_1$, $X…
The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical…
We introduce a new category C, which we call the cluster category, obtained as a quotient of the bounded derived category D of the module category of a finite-dimensional hereditary algebra H over a field. We show that, in the simply-laced…
This paper provides answers to questions regarding the almost sure limiting behavior of rooted, binary tree-structured rules for regression. Examples show that questions raised by Gordon and Olshen in 1984 have negative answers. For these…
We introduce a new algebraic concept of an algebra which is "almost" commutative (more precisely "quasi-commutative differential graded algebra" or ADGQ, in French). We associate to any simplicial set X an ADGQ - called D(X) - and show how…
The paper introduces a Poisson-type problem on a mixed-dimensional structure combining a Euclidean domain and a lower-dimensional self-similar component touching a compact surface (interface). The lower-dimensional piece is a so-called…
A forest is a generalization of a tree, and here we consider the Aronszajn and Suslin properties for forests. We focus on those forests satisfying coherence, a local smallness property. We show that coherent Aronszajn forests can be…
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 such a tree,…