Article contents
On countably closed complete Boolean algebras
Published online by Cambridge University Press: 12 March 2014
Abstract
It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1996
References
REFERENCES
[1]Foreman, M., Games played on Boolean algebras, this Journal, vol. 48 (1983), pp. 714–723.Google Scholar
[2]Jech, T., A game-theoretic property of Boolean algebras, (Macintyre, A.et al., editors), Logic Colloquium 77, North-Holland, Amsterdam, 1978, pp. 135–144.Google Scholar
[3]Jech, T., More game-theoretic properties of Boolean algebras, Annals of Pure and Applied Logic, vol. 26 (1984), pp. 11–29.CrossRefGoogle Scholar
[4]Veličković, B., Playful Boolean algebras, Transactions of the American Mathematical Society, vol. 296 (1986), pp. 727–740.CrossRefGoogle Scholar
[5]Vojtáš, P., Game properties of Boolean algebras, Comment. Math. Univ. Carol., vol. 24 (1983), pp. 349–369.Google Scholar
- 1
- Cited by