Boolean Algebra

Boolean algebra is a special branch of algebra which is mostly used in digital electronics. Boolean algebra was invented in the year of 1854, by an English mathematician George Boole. Boolean algebra is a method of simplifying the logic circuits (or sometimes called as logic switching circuits) in digital electronics. So it is also called as “Switching algebra”. We can represent the functioning of logic circuits by using numbers, by following some rules, which are well known as “Laws of Boolean algebra”. We can also make the calculations and logical operations of the circuits even faster by following some theorems, which are known as “Theorems of Boolean Algebra”. A Boolean function is a function which represents the relation between the input and output of a logic circuit. Boolean logic allows only two states of the circuit, such as True and False. These two states are represented by 1 and 0, where 1 represents the state “True” and 0 represents the state “False”. The most important thing to remember in Boolean algebra is that it is very much different than regular mathematical algebra and its methods. Before learning about the Boolean algebra, lets us know about the history of Boolean algebra and its invention and development.