Papers
Topics
Authors
Recent
Search
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".

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.