A model in which every infinite Boolean algebra has many subalgebras

Details A model in which every infinite Boolean algebra has many subalgebras A model in which every infinite Boolean algebra has many subalgebras

1995-09-15

arxiv.org/abs/math/9509227v1

J. Symbolic Logic 60 (1995), 992--1004

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A model in which every infinite Boolean algebra has many subalgebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A model in which every infinite Boolean algebra has many subalgebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A model in which every infinite Boolean algebra has many subalgebras will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-88653