- 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
Computable Boolean algebras
Journal of Symbolic Logic 65 (4):1605-1623 (2000)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On Boolean algebras and integrally closed commutative regular rings.Misao Nagayama - 1992 - Journal of Symbolic Logic 57 (4):1305-1318.
Partial Boolean algebras in a broader sense.Janusz Czelakowski - 1979 - Studia Logica 38 (1):1 - 16.
Plain semi-post algebras as a poset-based generalization of post algebras and their representability.Nguyen Cat Ho & Helena Rasiowa - 1989 - Studia Logica 48 (4):509 - 530.
W-algebras which are Boolean products of members of SR[1] and CW-algebras.Antoni Torrens - 1987 - Studia Logica 46 (3):265 - 274.
Averaging the truth-value in łukasiewicz logic.Daniele Mundici - 1995 - Studia Logica 55 (1):113 - 127.
Q-ultrafilters and normal ultrafilters in b-algebras.Bronis?aw Tembrowski - 1986 - Studia Logica 45 (2):167 - 179.
Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
The theory of Boolean algebras with an additional binary operation.Bronis?aw Tembrowski - 1983 - Studia Logica 42 (4):389 - 405.
Analytics
Added to PP
2009-01-28
Downloads
244 (#82,885)
6 months
19 (#135,510)
2009-01-28
Downloads
244 (#82,885)
6 months
19 (#135,510)
Historical graph of downloads
Citations of this work
Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.
Turing degree spectra of differentially closed fields.David Marker & Russell Miller - 2017 - Journal of Symbolic Logic 82 (1):1-25.
Computability-theoretic complexity of countable structures.Valentina S. Harizanov - 2002 - Bulletin of Symbolic Logic 8 (4):457-477.
Coding and Definability in Computable Structures.Antonio Montalbán - 2018 - Notre Dame Journal of Formal Logic 59 (3):285-306.
Computably categorical Boolean algebras enriched by ideals and atoms.P. E. Alaev - 2012 - Annals of Pure and Applied Logic 163 (5):485-499.
References found in this work
Recursive and r.e. quotient Boolean algebras.John J. Thurber - 1994 - Archive for Mathematical Logic 33 (2):121-129.
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-64dd777598-wg6s5 uwo