- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Complexity-theoretic algebra II: Boolean algebras
Annals of Pure and Applied Logic 44 (1-2):71-99 (1989)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
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 cardinal invariants of Boolean algebras.Andrzej Rosłanowski & Saharon Shelah - 2000 - Annals of Pure and Applied Logic 103 (1-3):1-37.
More on the cut and choose game.Jindřich Zapletal - 1995 - Annals of Pure and Applied Logic 76 (3):291-301.
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.
Remarks on superatomic boolean algebras.James E. Baumgartner & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):109-129.
Analytics
Added to PP
2014-01-16
Downloads
27 (#824,377)
6 months
8 (#580,966)
2014-01-16
Downloads
27 (#824,377)
6 months
8 (#580,966)
Historical graph of 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.
On the lattices of NP-subspaces of a polynomial time vector space over a finite field.Anil Nerode & J. B. Remmel - 1996 - Annals of Pure and Applied Logic 81 (1-3):125-170.
References found in this work
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
Recursion Theory and Algebra.G. Metakides, A. Nerode, J. N. Crossley, Iraj Kalantari & Allen Retzlaff - 1986 - Journal of Symbolic Logic 51 (1):229-232.
Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces.Iraj Kalantari & Allen Retzlaff - 1977 - Journal of Symbolic Logic 42 (4):481-491.
On R.e. And CO-R.E. Vector spaces with nonextendible bases.J. Remmel - 1980 - Journal of Symbolic Logic 45 (1):20-34.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lv8mh dc2