The Strong Amalgamation Property for Complete Boolean Algebras

Mathematical Logic Quarterly 20 (31-33):499-502 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

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

P_≠ _NP for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.
P ≠ NP for all infinite Boolean algebras.Mihai Prunescu - 2003 - Mathematical Logic Quarterly 49 (2):210-213.
A note on complete partitions in boolean algebras.Wojciech Sachwanowicz - 1990 - Mathematical Logic Quarterly 36 (3):229-232.
Universal Complete Boolean Algebras and Cardinal Collapsing.J. L. Bell - 1976 - Mathematical Logic Quarterly 22 (1):161-164.
Dense subtrees in complete Boolean algebras.Bernhard König - 2006 - Mathematical Logic Quarterly 52 (3):283-287.
Rudin-Keisler Posets of Complete Boolean Algebras.A. Pinus, P. Jipsen & H. Rose - 2001 - Mathematical Logic Quarterly 47 (4):447-454.
Strong amalgamation property of diagonalizable algebras.Irena Janicka-Zuk - 1983 - Bulletin of the Section of Logic 12 (3):105-108.

Analytics

Added to PP
2014-01-16

Downloads
2 (#1,823,102)

6 months
2 (#1,445,852)

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

No references found.

Add more references