A simple construction for rigid and weakly homogeneous Boolean algebras answering a question of Rubin
HTML articles powered by AMS MathViewer
- by Gary Brenner PDF
- Proc. Amer. Math. Soc. 87 (1983), 601-606 Request permission
Abstract:
We introduce a method for constructing Boolean algebras from trees which preserves some of the trees’ properties. The method is used to produce a very simple construction for rigid Boolean algebras and to construct a weakly homogeneous Boolean algebra without homogeneous factors.References
-
G. Brenner, A new rigid Boolean algebra, Abstracts Amer. Math. Soc. 1 (1980), 389.
—, Tree algebras, Abstracts Amer. Math. Soc. 2 (1981), 270-271.
E. K. van Douwen, An easy compact zero-dimensional rigid space.
- Eric K. van Douwen, J. Donald Monk, and Matatyahu Rubin, Some questions about Boolean algebras, Algebra Universalis 11 (1980), no. 2, 220–243. MR 588216, DOI 10.1007/BF02483101 S. Koppelberg, A lattice structure on the isomorphism types of complete Boolean algebras, Set Theory and Model Theory, Proceedings, Bonn 1979, vol, 872, Springer-Verlag, Berlin and New York, 1981, pp. 98-126.
- Matatyahu Rubin, On the reconstruction of Boolean algebras from their automorphism groups, Arch. Math. Logik Grundlag. 20 (1980), no. 3-4, 125–146. MR 603333, DOI 10.1007/BF02021132 R. M. Solovay (unpublished).
Additional Information
- © Copyright 1983 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 87 (1983), 601-606
- MSC: Primary 06E05
- DOI: https://doi.org/10.1090/S0002-9939-1983-0687625-3
- MathSciNet review: 687625