|
|
Definition of Boolean algebra
1. Noun. A system of symbolic logic devised by George Boole; used in computers.
Definition of Boolean algebra
1. Noun. (context algebra logic computing) An algebra in which all elements can take only one of two values (typically 0 and 1, or "true" and "false") and are subject to operations based on AND, OR and NOT ¹
2. Noun. (algebra) An algebra with two binary operators which are both associative, both commutative, such that both operators are distributive with respect to each other, with a pair of identity elements: one for each operator, and a unary complementation operator which simultaneously yields the inverse with respect to both operators. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Boolean Algebra
Literary usage of Boolean algebra
Below you will find example usage of this term as found in modern and/or classical literature:
1. Geometric Computing Science: First Steps by Robert Hermann (1991)
"Mathematically, we can identify the ‘algebra' of ‘predicates' of form (14.6) with
the boolean algebra (14.4). One strategy that computer scientists ..."
Other Resources:
