Skip to content
Get App

Boolean Algebra 1 – The Laws of Boolean Algebra

Learn the laws of Boolean algebra through logic circuits and base-10 number properties: annulment, identity, complement, double negation, associative, commutative laws.

Key Takeaways

  • Boolean algebra laws let designers simplify logic circuits into equivalent, cheaper, faster, and more reliable versions.
  • Annulment, identity, complement, and double negation laws form the core rules for simplifying expressions.
  • Boolean addition corresponds to OR and Boolean multiplication corresponds to AND, and these follow familiar arithmetic-like properties.
  • Associative and commutative properties hold for Boolean operations, so grouping and input order do not change the result.

What the video covers

  • Introduces why Boolean algebra laws matter: simplifying complex logic circuits makes them cheaper, faster, more reliable, and less heat-generating.
  • Explains annulment laws: an OR gate with a constant 1 input or an AND gate with a constant 0 input makes input A irrelevant.
  • Explains identity laws: OR with 0 or AND with 1 passes the input through unchanged.
  • Shows that OR or AND of an input with itself returns that input (idempotent/identity law).
  • Covers complement laws: A OR NOT A always gives 1, and A AND NOT A always gives 0.
  • Covers the double negation law: an even number of NOT gates in series returns the original input.
  • Relates Boolean addition to the OR gate and Boolean multiplication to the AND gate, noting there is no Boolean subtraction or division.
  • Reviews associative and commutative properties of base-10 arithmetic and maps them to Boolean operations.
  • Notes that intermediate steps in simplification may introduce 1s and 0s that are later eliminated.
  • Previews the next video, which applies these laws to simplify complex Boolean expressions, including absorption.

Answers

Questions about this video

Why does the video say we need Boolean algebra laws?

The laws let you simplify complex Boolean expressions into simpler equivalent forms. A simpler circuit with fewer components is more reliable, faster, generates less heat, and is cheaper to build.

What is the annulment law in this video?

An OR gate with one input permanently at 1 always outputs 1, and an AND gate with one input permanently at 0 always outputs 0, regardless of input A. Input A has no effect in either case.

How does the video relate Boolean addition and multiplication to logic gates?

Boolean addition corresponds to the OR gate, since 1 + 1 = 1 in Boolean logic, and Boolean multiplication corresponds to the AND gate. The video notes there is no Boolean subtraction or division.

Full Transcript — Download SRT & Markdown

00:00
Speaker A
this video is about the laws of boolean algebra you will see how these laws can be derived by examining simple logic circuits and by considering some familiar properties of base 10 numbers in the video that follows on from this one you'll see how the laws of boolean algebra can be applied to simplify complex boolean expressions and you'll have an opportunity to practice the skills involved before looking in detail at the laws of boolean algebra let's briefly consider why we need them here's
00:36
Speaker A
a complex combination of logic gates and here's an expression that describes the output Z in terms of the inputs a B and C this boolean expression is an accurate description of this particular circuit boolean algebra can be applied step by step to reduce a complex expression like this one into its simplest form all of these expressions are equivalent they each describe a different circuit but all of these circuits do exactly the same thing the behaviors of these circuits can be described with exactly the same truth table so this combination of logic gates does exactly the same job as the complex combination but clearly it is much simpler it needs less components so it's more reliable it's
01:36
Speaker A
faster it generates less heat and it's cheaper to make because boolean algebra can be used to simplify complex expressions and therefore the circuits they describe boolean algebra is an extremely powerful tool for designing computers before you can use boolean algebra to simplify a complex expression you first need to know the laws indeed you need to be so familiar with these laws that you can easily spot where and how they can be usefully applied then you will need plenty of practice at
02:13
Speaker A
simplifying complex expressions to really master the skills involved consider this or gate one of the inputs is permanently set to one there is always at least one input of one so there will always be an output of one regardless of the value of a with this and gate one of the inputs is fixed at zero so the output will always be zero regardless of a these expressions are collectively known as the annulment law you may have heard the term annulment with regards to a marriage that doesn't
02:52
Speaker A
legally exist to a null actually means to declare null and void you can see in both of these cases that input a has no effect consider this or gate one of the inputs is always zero so the output will always match the value of input a if input a is zero we have two zeros going in so a zero comes out if input a is one we have a 1 and a 0 going in so a 1 comes out this and gate arrangement is similar with one of the inputs permanently set to 1 the output will always match input a this pair of
03:36
Speaker A
expressions are referred to collectively as the identity law an input Ord with a zero or ANDed with a 1 will always give an output that is equal to the input take a look at this arrangement here both inputs of the or gate are always the same if a is 1 both inputs will be 1 so the output will be 1 if input a is 0 both inputs will be 0 so the output will also be 0 in the same way if both inputs of an and gate are always the same then the output of the gate will match this is known as the
04:16
Speaker A
identity law put simply an input that is odd with itself will result in an output that is equal to have input an input that is an with itself will also result in an output that is equal to the input the next few laws involve not gates in this combination the or gate is being fed input a along with its inverse so the or gate is always being fed a 1 and a 0 regardless of the value of a the output of the or gate in this arrangement must therefore always be 1 in this
04:58
Speaker A
combination the and gate is being fed input a along with its inverse so the and gate is always being fed a 1 and a 0 regardless of what a is the output of the and gate here must always be 0 another name for the inverse of a boolean value is its complement so these expressions are known as the complement law here we have two knocked gates in series if the input is a the output is not not a if a is 1 the output is 1 if a is 0 the output is 0 in other words the
05:39
Speaker A
output always matches the input this is called the double and negation law in fact any even number of not gates in series will produce an output that matches the input now you may be thinking at this stage that boolean expressions that describe combinations of logic gates don't normally include ones and zeros they contain only letters and symbols that describe the outputs in terms of the inputs however once you start to apply the laws you'll see that some of the intermediate steps of
06:14
Speaker A
simplifying a complex expression may well include ones and zeros that are eventually eliminated before continuing let's take a look at the concepts of boolean addition and boolean multiplication consider this 0 plus 0 equals 0 of course 0 plus 1 equals 1 one plus zero also equals one of course now in boolean logic there is only true and false and the logic gate deals with binary ones and zeros only so when it comes to one plus one it must be equal to something and that certainly isn't
06:58
Speaker A
zero so one plus one equals one in fact logically speaking one plus one plus one plus one plus one equals one look at the similarity between these addition sums and the truth table for an or gate we say that boolean addition corresponds to the logical function of an or gate now look at these multiplication operations no surprises here at all compare these with the truth table for an and gate here you can see that boolean multiplication corresponds to the logical function of an and gate
07:43
Speaker A
by the way there's no such thing as boolean subtraction that would imply the existence of negative numbers but there is only one and zero there's no such thing as boolean division either because division is actually repeated subtraction in order to derive the next set of laws we're going to review some basic properties of base 10 numbers namely associative commutative and distributive properties these properties are particularly relevant to students of advanced mathematics but you may well
08:18
Speaker A
have been already applying these to base 10 arithmetic without a second thought the associative property tells us something about the way numbers can be grouped you know that 5 plus 2 plus 3 equals 10 and that 5 plus 2 plus 3 also equals 10 it doesn't matter which pair of values you add together first you get the same result this can be written algebraically as a plus B plus C equals a plus B plus C now because edition corresponds to the boolean or operation we can say that a
09:00
Speaker A
or B or C equals a or B or C the only difference between each side of the equation is the position of the brackets and they make no difference in terms of logic gates we're saying that these two subtly different circuits behave in exactly the same way in a similar fashion we know that 5 times 2 times 3 equals 30 and that 5 times 2 times 3 is also 30 algebraically we can write a times B times C equals a times B times C in base 10 algebra we tend to omit the multiplication symbols now because
09:54
Speaker A
multiplication is like a boolean and operation it follows that a + b + C equals a and B and C to put it another way the behaviors of these two gate combinations are identical the commutative property refers to the way that numbers can be moved around in an expression for example 4 plus 8 equals 12 and so does 8 plus 4 algebraically we can say that a plus B equals B plus a the boolean equivalent is a or B equals B or a the logic gate equivalent of this equation is rather trivial all we're
10:39
Speaker A
really saying is that it makes no difference if we swap around the inputs of an or gate in a similar example 4 times 8 equals 32 as does 8 times 4 hence a times B equals B times a so it follows that a and B equals B and a once again we're really saying that it makes no difference if we swap the inputs of an and gate moving on you may have come across algebraic problems that require you to expand the brackets or conversely factorize an expression problems such as
11:22
Speaker A
these rely on the distributive property of numbers for example 2 times 3 plus 4 is equal to 2 times 3 plus 2 times 4 in regular algebra we can write a brackets B plus C equals a b plus AC the boolean equivalent is a and brackets B or C equals brackets a and B or brackets a and C we can prove the correctness of the so called and distributive law by comparing the circuits described by either side of this equation inspect this carefully and you will see that they behave in the same way they share
12:09
Speaker A
the same truth table so the law is quite correct we can also derive the related or distributive law in the same way this law has no equivalents in standard algebra but this visual proof is convincing enough our distributive law is now in place we can now add another law the so called absorptive law also known as the redundants law the absorptive law can also be proved with truth tables notice here that only when input a is 1 can the output be 1 in fact the output is always the same as a so if
12:55
Speaker A
you can spot the term a and a or B within a complex expression it can be replaced with simply a here to notice that input a must be 1 together 1 out the output of this circuit is also always a so the term a all brackets a and B can be absorbed and replaced by a
13:29
Speaker A
here are the laws we have so far the last law we're going to mention gets its name from George Bulls esteemed friend and collaborator or Gustus de Morgan the so called demorgan's theorum de Morgan used the rules of boolean algebra that you've now met to prove that the complement of the product of two variables is equal to the sum of their complements in other words he proved that this term is equivalent to this term when we examine the corresponding logic gate circuits and their truth
14:08
Speaker A
tables we can see that both sides of the equation are indeed the same de Morgan also showed that the complement of the sum of two variables is equal to the product of their complements in other words this equation examination of the circuits and their truth tables reveals that this equation is also correct so now we have a full set of laws in the video that follows on from this one I'll show you how to start using them make sure you've got them handy
Topics:Boolean algebralogic gatesannulment lawidentity lawcomplement lawdouble negationassociative propertycommutative propertydigital logictruth table

Get More with the SozAI App

Transcribe recordings, audio files, and YouTube videos — with AI summaries and speaker detection. 30 minutes free.

Or transcribe another YouTube video here →