On countably closed complete Boolean algebras

Journal of Symbolic Logic 61 (4):1380-1386 (1996)
  Copy   BIBTEX

Abstract

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On sequentially closed subsets of the real line in.Kyriakos Keremedis - 2015 - Mathematical Logic Quarterly 61 (1-2):24-31.
Analytic countably splitting families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.
Semi-Cohen Boolean algebras.Bohuslav Balcar, Thomas Jech & Jindřich Zapletal - 1997 - Annals of Pure and Applied Logic 87 (3):187-208.
Some remarks on openly generated Boolean algebras.Sakaé Fuchino - 1994 - Journal of Symbolic Logic 59 (1):302-310.
Iterations of Boolean algebras with measure.Anastasis Kamburelis - 1989 - Archive for Mathematical Logic 29 (1):21-28.
Small fields.Frank Wagner - 1998 - Journal of Symbolic Logic 63 (3):995-1002.
A Calculus of Regions Respecting Both Measure and Topology.Tamar Lando & Dana Scott - 2019 - Journal of Philosophical Logic 48 (5):825-850.

Analytics

Added to PP
2009-01-28

Downloads
59 (#363,761)

6 months
4 (#1,255,690)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Games played on partial isomorphisms.Jouko Väänänen & Boban Veličković - 2004 - Archive for Mathematical Logic 43 (1):19-30.
σ-short Boolean algebras.Makoto Takahashi & Yasuo Yoshinobu - 2003 - Mathematical Logic Quarterly 49 (6):543-549.

Add more citations

References found in this work

More game-theoretic properties of boolean algebras.Thomas J. Jech - 1984 - Annals of Pure and Applied Logic 26 (1):11-29.

Add more references