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)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90047-x

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,756

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

O'Donnell, MJ, see Lipton, J. 187-239 Remmel, JB, see Nerode, A. 125-170.S. Feferman - 1996 - Annals of Pure and Applied Logic 81:241.
More game-theoretic properties of boolean algebras.Thomas J. Jech - 1984 - Annals of Pure and Applied Logic 26 (1):11-29.
Moderate families in Boolean algebras.Lutz Heindorf - 1992 - Annals of Pure and Applied Logic 57 (3):217-250.
Semi-Cohen Boolean algebras.Bohuslav Balcar, Thomas Jech & Jindřich Zapletal - 1997 - Annals of Pure and Applied Logic 87 (3):187-208.
Every recursive boolean algebra is isomorphic to one with incomplete atoms.Rod Downey - 1993 - Annals of Pure and Applied Logic 60 (3):193-206.
More on the cut and choose game.Jindřich Zapletal - 1995 - Annals of Pure and Applied Logic 76 (3):291-301.
More on cardinal invariants of Boolean algebras.Andrzej Rosłanowski & Saharon Shelah - 2000 - Annals of Pure and Applied Logic 103 (1-3):1-37.
Narrow boolean algebras.Robert Bonnet & Saharon Shelah - 1985 - Annals of Pure and Applied Logic 28 (1):1-12.
Remarks on superatomic Boolean algebras.J. E. Baumgartner - 1987 - Annals of Pure and Applied Logic 33 (2):109.
Recursively rigid Boolean algebras.Jeffrey B. Remmel - 1987 - Annals of Pure and Applied Logic 36:39-52.

Analytics

Added to PP
2014-01-16

Downloads
29 (#869,362)

6 months
5 (#875,252)

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

References found in this work

On R.e. And CO-R.E. Vector spaces with nonextendible bases.J. Remmel - 1980 - Journal of Symbolic Logic 45 (1):20-34.
Recursively enumerable vector spaces.G. Metakides - 1977 - Annals of Mathematical Logic 11 (2):147.

View all 12 references / Add more references