2000 character limit reached
Ladders and Squares
Published 1 May 2025 in math.LO and math.CO | (2505.00414v1)
Abstract: In 1984, Ditor asked two questions: (1) For each and infinite cardinal , is there a join-semilattice of breadth and cardinality whose principal ideals have cardinality $< \kappa$? (2) For each , is there a lower-finite lattice of cardinality whose elements have at most lower covers? We show that both questions have positive answers under the axiom of constructibility, and hence consistently with . More specifically, we derive the positive answers from assuming that holds for enough 's.
Paper Prompts
Sign up for free to create and run prompts on this paper.