Journal of Symbolic Logic

On Countably Closed Complete Boolean Algebras

Thomas Jech and Saharon Shelah

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.

Article information

Source
J. Symbolic Logic, Volume 61, Issue 4 (1996), 1380-1386.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183745141

Mathematical Reviews number (MathSciNet)
MR1456113

Zentralblatt MATH identifier
0871.06008

JSTOR
links.jstor.org

Keywords
03E Boolean algebra countably closed game-closed forcing

Citation

Jech, Thomas; Shelah, Saharon. On Countably Closed Complete Boolean Algebras. J. Symbolic Logic 61 (1996), no. 4, 1380--1386. https://projecteuclid.org/euclid.jsl/1183745141


Export citation