Complexity-theoretic algebra II: Boolean algebras

Annals of Pure and Applied Logic 44 (1-2):71-99 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Hyper-Archimedean BL-algebras are MV-algebras.Esko Turunen - 2007 - Mathematical Logic Quarterly 53 (2):170-175.
Boolean deductive systems of BL-algebras.Esko Turunen - 2001 - Archive for Mathematical Logic 40 (6):467-473.
Minimum‐sized Infinite Partitions of Boolean Algebras.J. Donald Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.
Some Boolean Algebras with Finitely Many Distinguished Ideals I.Regina Aragón - 1995 - Mathematical Logic Quarterly 41 (4):485-504.
Boolean products of R0-algebras.Xiangnan Zhou & Qingguo Li - 2010 - Mathematical Logic Quarterly 56 (3):289-298.
Some remarks on openly generated Boolean algebras.Sakaé Fuchino - 1994 - Journal of Symbolic Logic 59 (1):302-310.
Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.

Analytics

Added to PP
2014-01-16

Downloads
17 (#846,424)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Polynomial-time versus recursive models.Douglas Cenzer & Jeffrey Remmel - 1991 - Annals of Pure and Applied Logic 54 (1):17-58.
Space complexity of Abelian groups.Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel & Zia Uddin - 2009 - Archive for Mathematical Logic 48 (1):115-140.
Complexity, Decidability and Completeness.Douglas Cenzer & Jeffrey B. Remmel - 2006 - Journal of Symbolic Logic 71 (2):399 - 424.
Feasible graphs with standard universe.Douglas Cenzer & Jeffrey B. Remmel - 1998 - Annals of Pure and Applied Logic 94 (1-3):21-35.

Add more citations