Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
Hostname: page-component-7f7b94f6bd-q7wkk Total loading time: 0.529 Render date: 2022-06-30T04:20:42.767Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true
  • English
The Journal of Symbolic Logic The Journal of Symbolic Logic

Article contents

On countably closed complete Boolean algebras

Published online by Cambridge University Press:  12 March 2014

Thomas Jech  and
Saharon Shelah
Thomas Jech
Affiliation:
Department of Mathematics, The Pennsylvania State University, University Park, PA 16803, USA, E-mail: jech@math.psu.edu
Saharon Shelah
Affiliation:
School of Mathematics, The Hebrew University, Jerusalem, Israel Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, USA, E-mail: shelah@sunrise.huji.ac.ilshelah@math.rutgers.edu
Get access Rights & Permissions[Opens in a new window]

Abstract

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

Keywords

Boolean algebracountably closedgame-closedforcing
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 61 , Issue 4 , December 1996 , pp. 1380 - 1386
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Foreman, M., Games played on Boolean algebras, this Journal, vol. 48 (1983), pp. 714–723.Google Scholar
[2]Jech, T., A game-theoretic property of Boolean algebras, (Macintyre, A.et al., editors), Logic Colloquium 77, North-Holland, Amsterdam, 1978, pp. 135–144.Google Scholar
[3]Jech, T., More game-theoretic properties of Boolean algebras, Annals of Pure and Applied Logic, vol. 26 (1984), pp. 11–29.CrossRefGoogle Scholar
[4]Veličković, B., Playful Boolean algebras, Transactions of the American Mathematical Society, vol. 296 (1986), pp. 727–740.CrossRefGoogle Scholar
[5]Vojtáš, P., Game properties of Boolean algebras, Comment. Math. Univ. Carol., vol. 24 (1983), pp. 349–369.Google Scholar

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On countably closed complete Boolean algebras
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

On countably closed complete Boolean algebras
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

On countably closed complete Boolean algebras
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *