Dense subtrees in complete Boolean algebras

Mathematical Logic Quarterly 52 (3):283-287 (2006)
  Copy   BIBTEX

Abstract

We characterize complete Boolean algebras with dense subtrees. The main results show that a complete Boolean algebra contains a dense tree if its generic filter collapses the algebra's density to its distributivity number and the reverse holds for homogeneous algebras

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

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

Some Boolean Algebras with Finitely Many Distinguished Ideals I.Regina Aragón - 1995 - Mathematical Logic Quarterly 41 (4):485-504.
Boolean deductive systems of BL-algebras.Esko Turunen - 2001 - Archive for Mathematical Logic 40 (6):467-473.
Hyper-Archimedean BL-algebras are MV-algebras.Esko Turunen - 2007 - Mathematical Logic Quarterly 53 (2):170-175.
More constructions for Boolean algebras.Saharon Shelah - 2002 - Archive for Mathematical Logic 41 (5):401-441.
Boolean algebras in ast.Klaus Schumacher - 1992 - Mathematical Logic Quarterly 38 (1):373-382.
The number of openly generated Boolean algebras.Stefan Geschke & Saharon Shelah - 2008 - Journal of Symbolic Logic 73 (1):151-164.
Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.

Analytics

Added to PP
2013-12-01

Downloads
17 (#815,534)

6 months
3 (#880,460)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Games played on Boolean algebras.Matthew Foreman - 1983 - Journal of Symbolic Logic 48 (3):714-723.

Add more references