2000 character limit reached
Length and Depth
Published 15 Apr 2018 in math.LO | (1804.05304v1)
Abstract: We construct, in ZFC, a sequence of Boolean algebras for which the product of Lengths is strictly smaller than the Depth of the product algebra. This gives a positive answer to Problem 30 from Monk's book "Cardinal invariants on Boolean algebras".
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.