most citedSome questions on entangled linear orders

1 citations · 1 across the 3 of their papers we have counts for

collaborators

7 papers

math.LO2026

A solution to Ditor's problem

Lorenzo Notaro

We settle the long-standing open question whether there exists a -ladder of cardinality . Given a positive integer , an -ladder is a lower finite lattice whose e…

math.LO2026

Open Colorings and Baumgartner's Axiom

Lorenzo Notaro

We construct a model of where Baumgartner's Axiom fails, settling a question of Farah. Moreover, in the same model there is an -de…

math.LO20261 cited

Some questions on entangled linear orders

Raphaël Carroy, Maxwell Levine, Lorenzo Notaro

Entangled linear orders were first introduced by Abraham and Shelah. Todorčević showed that these linear orders exist under . We prove the following results: (1) If…

math.CO2026

On maximal ladders

Lorenzo Notaro

Given a positive integer , an -ladder is a lower finite lattice whose elements have at most lower covers. In 1984, Ditor proved that every -ladder has cardinality at m…

math.LO2026

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

Lorenzo Notaro

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 infi…

math.LO2025

The breadth of constructibility degrees and definable Sierpiński's coverings

Alessandro Andretta, Lorenzo Notaro

Generalizing a result of Törnquist and Weiss, we study the connection between the existence of Sierpiński's coverings of , and a cardinal invariant…