Introduction to Boolean Algebra

Introduction Tutorial Quiz Storyboard References

Origins of Boolean Algebra
Boolean algebra is a system that consists of only two values: “true” or “false”, “on” or “off”, “closed” or “open”. In 1847, George Boole published The Mathematical Analysis of Logic, a book that showed how to simplify a cryptic pile of data using a specific logic. Boole had an idea that said if a simple scheme of logic can be represented by precise symbols, then the whole scheme can be read as an algebraic equation. Boole’s idea is referred to today as Boolean algebra. Boolean algebra is still in use today for linguistics, law, natural sciences, and computer technology. Whole search engines are constructed on the basis of Boolean algebra but our site will teach you the basics of Boolean algebra. You can check our tutorial to learn the basics of Boolean algebra and later the math behind some of the more complex equations. You can later test you proficiency in Boolean algebra with our quiz. You can also learn more about Boolean algebra by referring to our references page. Thanks for you user using our services.

Origins of Boolean Algebra

Boolean algebra is a system that consists of only two values: “true” or “false”, “on” or “off”, “closed” or “open”. In 1847, George Boole published The Mathematical Analysis of Logic, a book that showed how to simplify a cryptic pile of data using a specific logic.
Boole had an idea that said if a simple scheme of logic can be represented by precise symbols, then the whole scheme can be read as an algebraic equation. Boole’s idea is referred to today as Boolean algebra.
Boolean algebra is still in use today for linguistics, law, natural sciences, and computer technology. Whole search engines are constructed on the basis of Boolean algebra but our site will teach you the basics of Boolean algebra. You can check our tutorial to learn the basics of Boolean algebra and later the math behind some of the more complex equations. You can later test you proficiency in Boolean algebra with our quiz. You can also learn more about Boolean algebra by referring to our references page. Thanks for you user using our services.

This is a logic gate that relates to equation X=A

This is an example of a Boolean algebra equation"C+D+D=X". Here we take a look at several ways that we approach to solve those questons.

This is an example of how to solve the equation using the laws.

C+D+D
Laws of the complements
{According to the Laws of the complements, A + A=1 for those two values in the end will have to be 1 or 0. In Boolean algebra there are only two values and when a value is negated, the opposite value will occur. Since 0+1=1 and the values of D+D will be 1 and 0, D+D will have to equal 0.}
=C+1
Laws of union
{According to the Laws of union, A+1=1 for there can be no value in Boolean algebra will be greater than 1. Therefore, adding the values of 0 or 1 with 1 will be equal to 1.}
=1

This is an example of how to solve the equation using a truth table.

C	D	D	X
0	0	1	1
0	1	0	1
1	0	1	1
1	1	0	1

If you like to learn more about Boolean algebra, try taking a look at these books. These books provide more complex algorithms as well as new methods to solve Boolean algebra. These books are recommended for people who want to continue studying computer engineering in the future.