Abstract
We introduce the class of minimally generated Boolean algebras, i.e. those algebras representable as the union of a continuous well-ordered chain of subalgebras A 1 where A i+1 is a minimal extension of A i. Minimally generated algebras are closely related to interval algebras and superatomic algebras.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Baumgartner (1976) Almost disjoint sets, the dense set problem and the partition calculus, Ann. Math. Logic 9, 401–439.
G. Brenner (1983) A simple construction for rigid and weakly homogeneous Boolean algebras answering a question of Rubin, Proc. Amer. Math. Soc. 87, 601–606.
Th. Jech (1978) Set Theory, Academic Press, New York.
S. Koppelberg (1989a) General theory of Boolean algebras, in Handbook of Boolean Algebras (ed. J. D. Monk), North Holland, Amsterdam.
S. Koppelberg (1989b) Projective Boolean algebras, in Handbook of Boolean Algebras (ed. J. D. Monk), North Holland, Amsterdam, pp. 741–773.
S. Koppelberg (1988) Counterexamples in minimally generated Boolean algebras, Acta Universitatis Carolinae — Math. Phys. 29(2), 27–36.
W. Mitchell (1972) Aronszajn trees and the independence of the transfer property, Ann. Math. Logic 5, 21–46.
S. Shelah (1981) On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements, Notre Dame J. Formal Logic 22, 301–308.
S. Todorčević (1984) Trees and linearly ordered sets, in Handbook of Set-Theoretic Topology (ed. K. Kunen and J. E. Vaughan), pp. 235–293.
Author information
Authors and Affiliations
Additional information
Communicated by B. Jonsson
Rights and permissions
About this article
Cite this article
Koppelberg, S. Minimally generated Boolean algebras. Order 5, 393–406 (1989). https://doi.org/10.1007/BF00353658
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00353658