Boolean algebra


Also found in: Thesaurus, Medical, Encyclopedia, Wikipedia.

Boolean algebra

n.
An algebra in which variables may have one of two values and the operations defined on them are logical OR, a type of addition, and logical AND, a type of multiplication.

Boolean algebra

(ˈbuːlɪən)
n
(Logic) a system of symbolic logic devised by George Boole to codify logical operations. It is used in computers

Bool′e•an al′gebra

(ˈbu li ən)
n.
a system of symbolic logic dealing with the relationship of sets: the basis of logic gates in computers.
[1885–90; after German. Boole (1815–64), English mathematician; see -an1]

Boolean algebra

(bo͞o′lē-ən)
A mathematical system dealing with the relationship between sets, used to solve problems in logic and engineering. Variables consist of 0 and 1 and operations are expressed as AND, OR, and NOT. Boolean algebra has been important in the development of modern computers and programming.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.Boolean algebra - a system of symbolic logic devised by George Boole; used in computers
formal logic, mathematical logic, symbolic logic - any logical system that abstracts the form of statements away from their content in order to establish abstract criteria of consistency and validity
Translations
Booleova algebrabooleovská algebra
Booleova algebra
Boolesk algebra
References in periodicals archive ?
Asymmetric theory and testing of algorithms applies Boolean algebra not matrix algebra.
A major series of achievements in the evolution of algorithms came during the 1800s, the first of which was established by English mathematician George Boole, who also penned The Laws of Thought and established Boolean Algebra.
He took the Boolean algebra he learned at U-M and applied it to electrical switches.
George Boole was a legendary mathematician who was responsible for creating Boolean Algebra.
He assumes no prior exposure to any hardware description language, but does expect readers to have some basic knowledge of Boolean algebra and electrical engineering fundamentals such as Ohm's law.
2) A Boolean algebra is a BCK-algebra, if A x B is defined to be A [logical not]B (A does not imply B).
I never regretted the extra load, because whether it was Boolean algebra or
The next few sections discuss broad categories of operations, including statistics, risk assessment, Boolean algebra, and types of calculations for economics and engineering.
P(S) = {Collection of all subsets of the set S} {P(S), [union], [intersection], [phi], S} is a lattice defined as the neutrosophic Boolean algebra of order [2.
Section 3 studies the Stanley-Reisner ring of the Boolean algebra.
Foster, The idempotent elements of a commutative ring form a Boolean Algebra, Duke math.