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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Nanodevices have terrible properties for building Boolean logic systems: high defect rates, high variability, high death rates… 
Highly Cited
2002
Highly Cited
2002
We present short single equational axioms for Boolean algebra in terms of disjunction and negation and in terms of the Sheffer… 
Highly Cited
2002
Highly Cited
2002
Volcanic rifted margins evolve by a combination of extrusive flood volcanism, intrusive magmatism, extension, uplift, and erosion… 
Highly Cited
2001
Highly Cited
2001
This paper presents a Web-based, cross-cultural, curricular initiative entitled Cultura, designed to develop foreign language… 
Highly Cited
1989
Highly Cited
1989
The notions of class, subclass and virtual procedure are fairly well understood and recognized as some of the key concepts in… 
1981
1981
A Boolean algebra (henceforth abbreviated B.A.) is said to be recursive if B is a recursive subset of the natural numbers N and… 
Highly Cited
1978
Highly Cited
1978
This paper discusses the implementation of a random logic function on an array of CMOS transistors. A graph-theoretical algorithm… 
Highly Cited
1972
Highly Cited
1972
Desirable properties of "easily testable networks" are given. A realization for arbitrary logic function, using AND and EXCLUSIVE… 
Highly Cited
1970
Highly Cited
1970
A denumerable structure is said to be recursive iff its universe is a recursive subset of the natural numbers and its relations…