Advertisement
Advertisement
Boolean algebra
[ boo-lee-uhn ]
noun
- Logic. a deductive logical system, usually applied to classes, in which, under the operations of intersection and symmetric difference, classes are treated as algebraic quantities.
- Mathematics. a ring with a multiplicative identity in which every element is an idempotent.
Boolean algebra
/ ˲úłÜËąôÉŞÉ˛Ô /
noun
- a system of symbolic logic devised by George Boole to codify logical operations. It is used in computers
Boolean algebra
/ ˛ú´ÇĚ ´ÇĚ â˛ąôŧ-É˛Ô /
- A form of symbolic logic, in which variables, which stand for propositions, have only the values âtrueâ (or â1â) and âfalseâ (or â0â). Relationships between these values are expressed by the Boolean operators AND, OR, and NOT. For example, âa + bâ means âa OR bâ, and its value is true as long as either a is true or b is true (or both). Boolean logic can be used to solve logical problems, and provides the mathematical tools fundamental to the design of digital computers. It is named after the mathematician George Boole.
- Also called Boolean logic
- See also logic gate
yĐÄvlog History and Origins
Origin of Boolean algebra1
Example Sentences
Work with computers long enough and you are sure to hear the phrase âBoolean algebra,â which refers to the machineâs underlying logic.
Engineers now routinely design computer hardware and software, telephone networks and other complex systems with the aid of Boolean algebra.
Boolean algebra and Boolean logic are very well known today, and form the backbone of electrical engineering and computer science.
Boole work, commonly referred to as Boolean algebra, went on to influence binary systems used in electrical circuits and computers.
The other was Alan Turing, who pointed out in the 1930s that, with Boolean algebra, only three logical functions are needed to process these âtruesâ and âfalsesââor, in computer terms, 1s and 0s.
Advertisement
Advertisement
Advertisement
Advertisement
Browse