Skip to search formSkip to main contentSkip to account menu

Boolean algebra

Known as: Boolean search, BooleanAlgebra, Boolean logic in computer science 
In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
A New Kind of ScienceAND gateAlgebraic normal formBinary data

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2011
Review
2011
Journal of Nanoscience and Nanotechnology
All manuscripts must contain an informative 150 to 300 words abstract explaining the essential contents of the work, key ideas… 
Highly Cited
2007
Highly Cited
2007
Self-organized computation with unreliable, memristive nanodevices
Nanodevices have terrible properties for building Boolean logic systems: high defect rates, high variability, high death rates… 
Highly Cited
2003
Highly Cited
2003
Image retrieval by texture similarity
Highly Cited
2002
Highly Cited
2002
Short Single Axioms for Boolean Algebra
We present short single equational axioms for Boolean algebra in terms of disjunction and negation and in terms of the Sheffer… 
Highly Cited
2001
Highly Cited
2001
VISIT TO NATIONAL CASH REGISTER CORPORATION OF DAYTON, OHIO
In recent years, much research has been devoted to the study of Boolean logic; however, few have developed the extensive… 
Highly Cited
2000
Highly Cited
2000
Semantic Indexing using WordNet Senses
We describe in this paper a boolean Information Retrieval system that adds word semantics to the classic word based indexing. Two… 
1981
1981
Recursive Boolean algebras with recursive atoms
A Boolean algebra (henceforth abbreviated B.A.) is said to be recursive if B is a recursive subset of the natural numbers N and… 
Review
1980
Review
1980
Local Microcode Compaction Techniques
Microcode compaction is an essential tool for the compilation of high-level language microprograms into microinstructions with… 
Highly Cited
1972
Highly Cited
1972
Easily Testable Realizations ror Logic Functions
Desirable properties of "easily testable networks" are given. A realization for arbitrary logic function, using AND and EXCLUSIVE… 
Highly Cited
1970
Highly Cited
1970
Hierarchies of Boolean algebras
A denumerable structure is said to be recursive iff its universe is a recursive subset of the natural numbers and its relations… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)