Searcharxiv⌕ Search

arXiv subjects

Lorenzo Notaro

Publications and source records attributed to Lorenzo Notaro.

10 recordsLinked to original sources
arXiv2026

Quagmires and large Suslin forests

In 1972, Jech asked whether there exists a Suslin $(\omega_1, \omega_2)$-forest in the constructible universe. As reported by Jech, Laver gave a positive answer, but his proof was never published and appears no longer to be available. In 2015, Eskew introduced the combinatorial principle $W^*_\kappa(\lambda)$, a strengthening of Silver's principle, and used it to construct a coherent Suslin $(\kappa, \lambda)$-forest. He then asked whether the principle $W^*_{\kappa^+}(\kappa^{++})$ holds in $\mathsf{L}$ for every regular cardinal $\kappa$. We give an affirmative answer to Eskew's question, thereby also settling Jech's question.

math.LO↗
arXiv2026

A solution to Ditor's problem

We settle the long-standing open question whether there exists a $3$-ladder of cardinality $\aleph_2$. Given a positive integer $n$, an $n$-ladder is a lower finite lattice whose elements have at most $n$ lower covers. In 1984, Ditor proved that every $n$-ladder has cardinality at most $\aleph_{n-1}$, and that this cardinal bound is sharp for $n = 1,2$. He then raised the question of whether the bound is attained for $n\ge 3$ as well. An affirmative answer is known to be consistent with $\mathsf{ZFC}$. We prove, relative to the consistency of a Mahlo cardinal, that the question is independent of $\mathsf{ZFC}$. More precisely, we show that the nonexistence of a $3$-ladder of cardinality $\aleph_2$ is equiconsistent with a Mahlo cardinal.

math.LO↗
arXiv2026

On maximal ladders

Given a positive integer $n$, an $n$-ladder is a lower finite lattice whose elements have at most $n$ lower covers. In 1984, Ditor proved that every $n$-ladder has cardinality at most $\aleph_{n-1}$ and asked whether this bound is sharp, i.e., whether for each $n$ there is an $n$-ladder of cardinality $\aleph_{n-1}$. We isolate the notion of maximal $n$-ladder and use it to study Ditor's problem and related questions. We show that $\text{Add}(\omega, \omega_\omega)$ forces every maximal $n$-ladder to have cardinality $\aleph_{n-1}$, and hence forces a positive answer to Ditor's question for every $n$. In particular, it is consistent that there are no maximal $3$-ladders of cardinality $\aleph_1$. However, we show that the existence of such a ladder follows from $\mathfrak{d}=\aleph_1$. Under $\clubsuit$, we construct a maximal $3$-ladder of breadth $2$. Finally, we prove that, consistently (under $\diamondsuit$), there exists a maximal $3$-ladder that is destructible by forcing with a Suslin tree.

math.CO↗
arXiv2026

Open Colorings and Baumgartner's Axiom

We construct a model of $\mathsf{MA_{\aleph_1}}+\mathsf{OCA}_T$ where Baumgartner's Axiom fails, settling a question of Farah. Moreover, in the same model there is an $\aleph_1$-dense set of reals which is neither reversible nor increasing, answering a question of Marun, Shelah, and Switzer.

math.LO↗
arXiv2025

Some questions on entangled linear orders

Entangled linear orders were first introduced by Abraham and Shelah. Todor\v{c}evi\'c showed that these linear orders exist under $\mathsf{CH}$. We prove the following results: (1) If $\mathsf{CH}$ holds, then, for every $n > 0$, there is an $n$-entangled linear order which is not $(n+1)$-entangled. (2) If $\mathsf{CH}$ holds, then there are two homeomorphic sets of reals $A, B \subseteq \mathbb{R}$ such that $A$ is entangled but $B$ is not $2$-entangled. (3) If $\mathbb{R}\subseteq \mathrm{L}$, then there is an entangled $\Pi_1^1$ set of reals. (4) If $\diamondsuit$ holds, then there is a $2$-entangled non-separable linear order.

math.LO↗
arXiv2025

Ladders and Squares

In 1984, Ditor asked two questions: (1) For each $n\in\omega$ and infinite cardinal $\kappa$, is there a join-semilattice of breadth $n+1$ and cardinality $\kappa^{+n}$ whose principal ideals have cardinality $< \kappa$? (2) For each $n \in \omega$, is there a lower-finite lattice of cardinality $\aleph_{n}$ whose elements have at most $n+1$ lower covers? We show that both questions have positive answers under the axiom of constructibility, and hence consistently with $\mathsf{ZFC}$. More specifically, we derive the positive answers from assuming that $\square_\kappa$ holds for enough $\kappa$'s.

math.LO↗
arXiv2025

Constructibility real degrees in the side-by-side Sacks model

We study the join-semilattice of constructibility real degrees in the side-by-side Sacks model, the model of set theory obtained by forcing with a countable-support product of infinitely many Sacks forcings over the constructible universe. In particular, we prove that in the side-by-side Sacks model the join-semilattice of constructibility real degrees is rigid, i.e. it does not have non-trivial automorphisms.

math.LO↗
arXiv2023

Does $\mathsf{DC}$ imply $\mathsf{AC}_\omega$, uniformly?

The Axiom of Dependent Choice $\mathsf{DC}$ and the Axiom of Countable Choice $\mathsf{AC}_\omega$ are two weak forms of the Axiom of Choice that can be stated for a specific set: $\mathsf{DC}(X)$ asserts that any total binary relation on $X$ has an infinite chain, while $\mathsf{AC}_\omega (X)$ asserts that any countable collection of nonempty subsets of $X$ has a choice function. It is well-known that $\mathsf{DC} \Rightarrow \mathsf{AC}_\omega$. We study for which sets and under which hypotheses $\mathsf{DC}(X) \Rightarrow \mathsf{AC}_\omega (X)$, and then we show it is consistent with $\mathsf{ZF}$ that there is a set $A \subseteq \mathbb{R}$ for which $\mathsf{DC} (A)$ holds, but $\mathsf{AC}_\omega (A)$ fails.

math.LO↗
arXiv2023

A game for Baire's grand theorem

Generalizing a result of Kiss, we provide a game that characterizes Baire class 1 functions between arbitrary separable metrizable spaces. We show that the determinacy of our game is equivalent to a generalization of Baire's grand theorem, and that both these statements hold under AD and in Solovay's model.

math.LO↗