- 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
On Boolean Algebras and their Recursive Completions
Mathematical Logic Quarterly 31 (31‐34):481-486 (1985)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
On Boolean Algebras and their Recursive Completions.E. W. Madison - 1985 - Mathematical Logic Quarterly 31 (31-34):481-486.
Some Boolean algebras with finitely many distinguished ideals II.Regina Aragón - 2003 - Mathematical Logic Quarterly 49 (3):260.
Recursive and r.e. quotient Boolean algebras.John J. Thurber - 1994 - Archive for Mathematical Logic 33 (2):121-129.
A simple construction of representable relation algebras with non‐representable completions.Tarek Sayed Ahmed - 2009 - Mathematical Logic Quarterly 55 (3):237-244.
Closure Algebras and Boolean Algebras.G. J. Logan - 1977 - Mathematical Logic Quarterly 23 (1-6):93-96.
Closure Algebras and Boolean Algebras.G. J. Logan - 1976 - Mathematical Logic Quarterly 23 (1‐6):93-96.
Boolean powers over incomplete boolean algebras.Wojcech Sachwanowicz - 1990 - Mathematical Logic Quarterly 36 (5):431-440.
Chains in Boolean Semigroup Algebras.Lutz Heindorf - 1991 - Mathematical Logic Quarterly 37 (5-6):93-96.
Chains in Boolean Semigroup Algebras.Lutz Heindorf - 1991 - Mathematical Logic Quarterly 37 (5‐6):93-96.
An Axiomatization of Topological Boolean Algebras.Joel Kagan - 1972 - Mathematical Logic Quarterly 18 (7):103-106.
Analytics
Added to PP
2013-12-01
Downloads
2 (#1,819,493)
6 months
7 (#491,177)
2013-12-01
Downloads
2 (#1,819,493)
6 months
7 (#491,177)
Historical graph of downloads
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Computability of boolean algebras and their extensions.Donald A. Alton & E. W. Madison - 1973 - Annals of Mathematical Logic 6 (2):95-128.
The existence of countable totally nonconstructive extensions of the countable atomless Boolean algebra.E. W. Madison - 1983 - Journal of Symbolic Logic 48 (1):167-170.
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-68866f4b87-zhzfn uwo