On countably closed complete Boolean algebras

descriptionPublicationkeyboard_double_arrow_right Article , Preprint 01 Dec 1996Embargo end date: 01 Jan 1995 English Publisher:Cambridge University Press (CUP)Journal:Journal of Symbolic Logic, volume 61, pages 1,380-1,386 (issn: 0022-4812, eissn: 1943-5886,

Copyright policy )Funded by:NSF | U.S.-Czechoslovakia Mathe...

Authors: Thomas Jech; Saharon Shelah;

doi: 10.2307/2275822 , 10.48550/arxiv.math/9502203

arXiv: math/9502203

On countably closed complete Boolean algebras

- Summary
- Subjects
- Metrics

Abstract

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

Related Organizations

Rutgers, The State University of New Jersey
United States
Hebrew University of Jerusalem
Israel
Pennsylvania State University
United States

Keywords

forcing, countably closed complete Boolean algebras, FOS: Mathematics, Chain conditions, complete algebras, Consistency and independence results, Mathematics - Logic, Logic (math.LO), game-closed complete Boolean algebras

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average