Given a positive integer \(k\), a \(k\)-ladder is a lower-finite lattice whose elements have at most \(k\) lower covers. In 1984, Ditor asked whether for every \(k\) there is a \(k\)-ladder of cardinality \(\aleph_{k-1}\). We show that this question has a positive answer under the axiom of constructibility.
Ladders and Squares
16.10.2025 11:30 - 13:00
Organiser:
KGRC
Location: