Boolean Arithmetic | Boolean Algebra

Allow us commence our exploration of Boolean algebra by incorporating quantities collectively:



The to start with 3 sums make ideal perception to anybody common with elementary addition.

The previous sum, even though, is fairly probably accountable for much more confusion than any other solitary assertion in electronic electronics, for the reason that it looks to operate contrary to the standard concepts of mathematics.

Properly, it does contradict the rules of addition for real numbers, but not for Boolean quantities.

Keep in mind that in the entire world of Boolean algebra, there are only two attainable values for any quantity and for any arithmetic procedure: 1 or .

There is no this sort of detail as “2” inside the scope of Boolean values. Considering that the sum “1 + 1” undoubtedly isn’t , it must be 1 by process of elimination.

It does not issue how quite a few or handful of phrases we increase with each other, both. Consider the next sums:



OR Gate

Acquire a close seem at the two-expression sums in the first set of equations.

Does that sample appear acquainted to you? It really should! It is the exact pattern of 1’s and 0’s as noticed in the real truth desk for an OR gate.

In other phrases, Boolean addition corresponds to the logical perform of an “OR” gate, as properly as to parallel change contacts:



There is no this kind of factor as subtraction in the realm of Boolean arithmetic.

Subtraction indicates the existence of damaging quantities: 5 – 3 is the same issue as 5 + (-3), and in Boolean algebra damaging quantities are forbidden.

There is no these kinds of detail as division in Boolean arithmetic, possibly, considering that division is genuinely absolutely nothing extra than compounded subtraction, in the same way that multiplication is compounded addition.


AND Gate

Multiplication is legitimate in Boolean algebra, and thankfully it is the same as in authentic-selection algebra: something multiplied by is , and just about anything multiplied by 1 continues to be unchanged:



This established of equations need to also glance acquainted to you: it is the similar pattern uncovered in the fact desk for an AND gate.

In other words, Boolean multiplication corresponds to the rational purpose of an “AND” gate, as properly as to collection change contacts:



Like “normal” algebra, Boolean algebra works by using alphabetical letters to denote variables.

Not like “normal” algebra, nevertheless, Boolean variables are often Funds letters, by no means decrease-circumstance.

Mainly because they are allowed to possess only a single of two possible values, possibly 1 or , every single and every single variable has a complement: the opposite of its worth.

For example, if variable “A” has a worth of , then the enhance of A has a benefit of 1.

Boolean notation uses a bar above the variable character to denote complementation, like this:



NOT Gate

In published form, the complement of “A” denoted as “A-not” or “A-bar”. Occasionally a “prime” symbol is utilized to characterize complementation.

For case in point, A’ would be the complement of A, a lot the similar as working with a primary image to denote differentiation in calculus somewhat than the fractional notation d/dt.

Typically, while, the “bar” image finds extra prevalent use than the “primary” image, for explanations that will grow to be more apparent afterwards in this chapter.

Boolean complementation finds equivalency in the type of the NOT gate, or a usually-closed swap or relay make contact with:



The essential definition of Boolean quantities has led to the easy principles of addition and multiplication, and has excluded each subtraction and division as valid arithmetic functions.

We have a symbology for denoting Boolean variables, and their complements. In the upcoming segment we will carry on to develop Boolean identities.



  • Boolean addition is equivalent to the OR logic purpose, as well as parallel change contacts.
  • Boolean multiplication is equivalent to the AND logic functionality, as nicely as collection swap contacts.
  • Boolean complementation is equal to the NOT logic purpose, as well as ordinarily-shut relay contacts.