Unsupported Boolean algebras and forcing

Mathematical Logic Quarterly 50 (6):594-602 (2004)
  Copy   BIBTEX

Abstract

If κ is an infinite cardinal, a complete Boolean algebra B is called κ-supported if for each sequence 〈bβ : β αbβ = equation imagemath imageequation imageβ∈Abβ holds. Combinatorial and forcing equivalents of this property are given and compared with the other forcing related properties of Boolean algebras . The set of regular cardinals κ for which B is not κ-supported is investigated

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

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

Independence of Boolean algebras and forcing.Miloš S. Kurilić - 2003 - Annals of Pure and Applied Logic 124 (1-3):179-191.
Semi-Cohen Boolean algebras.Bohuslav Balcar, Thomas Jech & Jindřich Zapletal - 1997 - Annals of Pure and Applied Logic 87 (3):187-208.
Free Boolean algebras and nowhere dense ultrafilters.Aleksander Błaszczyk - 2004 - Annals of Pure and Applied Logic 126 (1-3):287-292.
Iterations of Boolean algebras with measure.Anastasis Kamburelis - 1989 - Archive for Mathematical Logic 29 (1):21-28.
Boolean products of R0-algebras.Xiangnan Zhou & Qingguo Li - 2010 - Mathematical Logic Quarterly 56 (3):289-298.
σ-short Boolean algebras.Makoto Takahashi & Yasuo Yoshinobu - 2003 - Mathematical Logic Quarterly 49 (6):543-549.
Boolean deductive systems of BL-algebras.Esko Turunen - 2001 - Archive for Mathematical Logic 40 (6):467-473.
Boolean algebras in ast.Klaus Schumacher - 1992 - Mathematical Logic Quarterly 38 (1):373-382.
On L∞κ-free Boolean algebras.Sakaé Fuchino, Sabine Koppelberg & Makoto Takahashi - 1992 - Annals of Pure and Applied Logic 55 (3):265-284.
Hyper-Archimedean BL-algebras are MV-algebras.Esko Turunen - 2007 - Mathematical Logic Quarterly 53 (2):170-175.
Forcing operators on MTL-algebras.George Georgescu & Denisa Diaconescu - 2011 - Mathematical Logic Quarterly 57 (1):47-64.
Decidable Boolean algebras of low level.S. S. Goncharov - 1998 - Annals of Pure and Applied Logic 94 (1-3):75-95.

Analytics

Added to PP
2013-12-01

Downloads
6 (#1,269,929)

6 months
1 (#1,042,085)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Independence of Boolean algebras and forcing.Miloš S. Kurilić - 2003 - Annals of Pure and Applied Logic 124 (1-3):179-191.

Add more citations

References found in this work

No references found.

Add more references