On countably closed complete boolean algebras

Thomas Jech*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

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

Original languageEnglish
Pages (from-to)1380-1386
Number of pages7
JournalJournal of Symbolic Logic
Volume61
Issue number4
DOIs
StatePublished - Dec 1996

Keywords

  • Boolean algebra
  • Countably closed
  • Forcing
  • Game-closed

Fingerprint

Dive into the research topics of 'On countably closed complete boolean algebras'. Together they form a unique fingerprint.

Cite this