Computability of boolean algebras and their extensions

Annals of Mathematical Logic 6 (2):95-128 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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.
On a four-valued modal logic with deductive implication.Marcelo E. Coniglio & Martín Figallo - 2014 - Bulletin of the Section of Logic 43 (1/2):1-18.
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.

Analytics

Added to PP
2014-01-17

Downloads
20 (#761,466)

6 months
6 (#509,125)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Recursive Real Numbers.Norman Shapiro - 1955 - Journal of Symbolic Logic 20 (2):177-177.

Add more references