The number of openly generated Boolean algebras

Journal of Symbolic Logic 73 (1):151-164 (2008)
  Copy   BIBTEX


This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly ϭ-filtered Boolean algebras. We show that for every uncountable regular cardinal κ there are 2κ pairwise non-isomorphic openly generated Boolean algebras of size κ > N1 provided there is an almost free non-free abelian group of size κ. The openly generated Boolean algebras constructed here are almost free. Moreover, for every infinite regular cardinal κ we construct 2κ pairwise non-isomorphic Boolean algebras of size κ that are tightly ϭ-filtered and c.c.c. These two results contrast nicely with Koppelberg's theorem in [12] that for every uncountable regular cardinal κ there are only 2<κ isomorphism types of projective Boolean algebras of size κ



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Some remarks on openly generated Boolean algebras.Sakaé Fuchino - 1994 - Journal of Symbolic Logic 59 (1):302-310.
A Note on Boolean Algebras with Few Partitions Modulo some Filter.Markus Huberich - 1996 - Mathematical Logic Quarterly 42 (1):172-174.
On L∞κ-free Boolean algebras.Sakaé Fuchino, Sabine Koppelberg & Makoto Takahashi - 1992 - Annals of Pure and Applied Logic 55 (3):265-284.
Unsupported Boolean algebras and forcing.Miloš S. Kurilić - 2004 - Mathematical Logic Quarterly 50 (6):594-602.
Boolean algebras in ast.Klaus Schumacher - 1992 - Mathematical Logic Quarterly 38 (1):373-382.


Added to PP

14 (#264,824)

6 months
5 (#1,552,255)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations