A model in which every Boolean algebra has many subalgebras
From MaRDI portal
Publication:4858830
DOI10.2307/2275769zbMATH Open0838.03038arXivmath/9509227OpenAlexW2056618168MaRDI QIDQ4858830FDOQ4858830
Authors: James Cummings, S. Shelah
Publication date: 19 December 1995
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Abstract: We show that it is consistent with ZFC (relative to large cardinals) that every infinite Boolean algebra B has an irredundant subset A such that 2^{|A|} = 2^{|B|}. This implies in particular that B has 2^{|B|} subalgebras. We also discuss some more general problems about subalgebras and free subsets of an algebra. The result on the number of subalgebras in a Boolean algebra solves a question of Monk. The paper is intended to be accessible as far as possible to a general audience, in particular we have confined the more technical material to a ``black box at the end. The proof involves a variation on Foreman and Woodin's model in which GCH fails everywhere.
Full work available at URL: https://arxiv.org/abs/math/9509227
Recommendations
Cites Work
- Title not available (Why is that?)
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- On the singular cardinals problem. I
- The generalized continuum hypothesis can fail everywhere
- Adding closed cofinal sequences to large cardinals
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- On integral relations in Boolean algebra
- Cardinal numbers associated with dense pseudocompact, countably compact, and \(\omega\)-bounded subgroups
- Title not available (Why is that?)
- A note on irredundant sets
- Title not available (Why is that?)
- The Number of Nonisomorphic Boolean Subalgebras of a Power Set
This page was built for publication: A model in which every Boolean algebra has many subalgebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858830)