View your list of saved words. (You can log in using Facebook.)
Definition of BOOLEAN ALGEBRA
: an algebraic system that consists of a set closed under two binary operations and that can be described by any of various systems of postulates all of which can be deduced from the postulates that each operation is commutative, that each operation is distributive over the other, that an identity element exists for each operation, and that for every element in the set there exists another element which when combined with the first under either one of the operations yields the identity element of the other operation
Symbolic system used for designing logic circuits and networks for digital computers. Its chief utility is in representing the truth value of statements, rather than the numeric quantities handled by ordinary algebra. It lends itself to use in the binary system employed by digital computers, since the only possible truth values, true and false, can be represented by the binary digits 1 and 0. A circuit in computer memory can be open or closed, depending on the value assigned to it, and it is the integrated work of such circuits that give computers their computing ability. The fundamental operations of Boolean logic, often called Boolean operators, are and, or, and not; combinations of these make up 13 other Boolean operators.