On countably closed complete Boolean algebras

Journal of Symbolic Logic 61 (4):1380-1386 (1996)
Abstract
It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed
Keywords 03E   Boolean algebra   countably closed   game-closed   forcing
Categories (categorize this paper)
DOI 10.2307/2275822
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,169
Through your library
References found in this work BETA
More Game-Theoretic Properties of Boolean Algebras.Thomas J. Jech - 1984 - Annals of Pure and Applied Logic 26 (1):11-29.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Scott Incomplete Boolean Ultrapowers of the Real Line.Masanao Ozawa - 1995 - Journal of Symbolic Logic 60 (1):160-171.
Definable Sets in Boolean Ordered o-Minimal Structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
Elementary Embedding Between Countable Boolean Algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
Analytic Countably Splitting Families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.
Some Remarks on Openly Generated Boolean Algebras.Sakaé Fuchino - 1994 - Journal of Symbolic Logic 59 (1):302-310.
Added to PP index
2009-01-28

Total downloads
13 ( #362,380 of 2,192,005 )

Recent downloads (6 months)
1 ( #289,020 of 2,192,005 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature