
Menu
Historical Overview
Definitions
Different names
Operators
Precedence rules
Truth Tables
Examples of Boolean Expressions
Purpose
Usage examples
Quiz
|
Historical Overview
They are named after George Boole, an English mathematician
at University College Cork, who first defined them as part
of a system of logic in the mid 19th century. Specifically,
Boolean algebra was an attempt to use algebraic techniques to
deal with expressions in the propositional calculus.
Today, Boolean algebras find many applications in electronic design.
For many reasons digital systems are based on an algebra--not the regular
algebra you and I are familiar with but rather Boolean algebra. Boolean
algebra is the theoretical foundation for digital systems.
As the inventor of Boolean algebra, the basis of all modern computer
arithmetic, Boole is regarded as one of the founders of the field of
computer science.
Boolean algebra formalizes the rules of logic. On the surface computers
are great number crunchers, but inside computations are performed by
binary digital circuits following the rules of logic. That is why it is important
to understand the Boolean expressions.
|