A solution to Ditor's problem
Logic
2026-06-27 v1 Combinatorics
Abstract
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 elements have at most lower covers. In 1984, Ditor proved that every -ladder has cardinality at most , and that this cardinal bound is sharp for . He then raised the question of whether the bound is attained for as well. An affirmative answer is known to be consistent with . We prove, relative to the consistency of a Mahlo cardinal, that the question is independent of . More precisely, we show that the nonexistence of a -ladder of cardinality is equiconsistent with a Mahlo cardinal.
Cite
@article{arxiv.2606.28844,
title = {A solution to Ditor's problem},
author = {Lorenzo Notaro},
journal= {arXiv preprint arXiv:2606.28844},
year = {2026}
}
Comments
24 pages