What is a Boolean expression?
A Boolean expression is an expression in which symbols are used to represent logic. Any symbol can be used, however, letters of the alphabet are generally used. Since the logic levels are generally associated with the symbols 1 and 0, whatever letters are used as variables which can take the values of 1 or 0.
What is Boolean Algebra?
Boolean algebra is mathematics of logic. It is one of the most basic tools available to the logic designer and thus can be used effectively for simplification of complex logic expressions.
Other useful and widely used techniques based on Boolean theorems include the use of Karnaugh maps.
Simplification Of Boolean Expression using Algebraic Techniques
Lets take a closer look at the different postulates and theorems of Boolean algebra and their applications in minimizing Boolean expressions.
Fundamental Concepts of Boolean Algebra
Boolean algebra has only two mathematical operations, addition and multiplication. These operations are associated with the OR and the AND functions respectively.
For the electronics circuits and signals, a logic 1 will represent a closed switch, a high voltage, or an “on” lamp, and a logic 0 will represent an open switch, low voltage, or an “off” lamp. These describe the only two states that exist in digital logic systems and will be used to represent the in and out conditions of logic gates.
Fundamental Laws and Theorems of Boolean Algebra
