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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

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

Scott incomplete Boolean ultrapowers of the real line.Masanao Ozawa - 1995 - Journal of Symbolic Logic 60 (1):160-171.
Some remarks on openly generated Boolean algebras.Sakaé Fuchino - 1994 - Journal of Symbolic Logic 59 (1):302-310.
Analytic countably splitting families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.
Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.

Analytics

Added to PP
2009-01-28

Downloads
50 (#320,996)

6 months
12 (#223,952)

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.
sigma-short Boolcan algebras.Makoto Takahashi & Yasuo Yoshinobu - 2003 - Mathematical Logic Quarterly 49 (6):543.
σ-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