Skip to main content
Engineering LibreTexts

2.2.C Simplifications

  • Page ID
    9847
  • The final piece of algebra in Boolean algebra is the observation that we can chain logical equivalences together. That is, from ≡ and ≡ R, it follows that ≡ R. This is really just a consequence of the Second Substitution Law: The equivalence ≡ allows us to substitute for in the statement ≡ Q, giving ≡ R. (Remember that, by Definition 2.5, logical equivalence is defined in terms of a proposition.) This means that we can show that two compound propositions are logically equivalent by finding a chain of logical equivalences that lead from one to the other. For example:

    ∧ (→ q) ≡ ∧ (¬∨ q)                    definition of → q, Theorem 2.2
                      ≡ (∧ ¬p) ∨ (∧ q)            Distributive Law

      ≡ F ∨ (∧ q)                       Law of Contradiction, Theorem 2.2

      ≡ (∧ q)                            Identity Law

    Each step in the chain has its own justification. In several cases, a substitution law is used without stating as much. In the first line, for example, the definition of → is that → ≡ ¬∨ q. The Second Substitution Law allows us to substitute (¬∨ q) for(→ q). In the last line, we implicitly applied the First Substitution Law to the Identity Law, F ∨ ≡ p, to obtain F ∨ (∧ q) ≡ (∧ q).

    The chain of equivalences in the above example allows us to conclude that ∧ (→ q)is logically equivalent to ∧ q. This means that if you were to make a truth table for these two expressions, the truth values in the column for ∧ (→ q) would be identical to those in the column for ∧ q. We know this without actually making the table. In this case, the table would only be four lines long and easy enough to make. But Boolean algebra can be applied in cases where the number of propositional variables is too large for a truth table to be practical.

    Let’s do another example. Recall that a compound proposition is a tautology if it is true for all possible combinations of truth values of the propositional variables that it contains. But another way of saying the same thing is that P is a tautology if ≡ T. So, we can prove that a compound proposition, P, is a tautology by finding a chain of logical equivalences leading from to T. For example:

    ((pq)∧¬p) → q
        ≡ (¬((pq)∧¬p))∨q            definition of 

        ≡ (¬(pq)∨¬(¬p))∨q          DeMorgan’s Law, Theorem 2.2

        ≡ (¬(∨ q) ∨ p) ∨ q           Double Negation, Theorem 2.2
        ≡ (¬(pq))∨(pq)              Associative Law for ∨

        ≡T                                    Law of Excluded Middle

    From this chain of equivalences, we can conclude that ((∨ q) ∧ ¬p) → is a tautology.

    Now, it takes some practice to look at an expression and see which rules can be ap- plied to it; to see (¬(∨ q)) ∨ (∨ q) as an application of the law of the excluded middle for example, you need to mentally substitute (∨ q) for in the law as it is stated in Figure 2.2. Often, there are several rules that apply, and there are no definite guidelines about which one you should try. This is what makes algebra something of an art.