Using Propositional equivalences, and the defnition or nor (mnemonic: "not or"), written ↓, φ ↓ ψ ≡¬ (φ ∨ ψ), express the function ∧ in terms of ↓ only. That is, give a formula which doesn't use ∧, ∨, ¬, but instead only uses ↓ and which has the same truth table as φ ∧ ψ.
Similar to the previous exercise, express each of the following using nand (Example ) only, and prove correctness using the algebraic identities (Propositional equivalences).
This operation is particularly interesting, since making a NAND gate in hardware requires only two transistors.
Using algebraic identities (Propositional equivalences), show that (a ∨ c) ∧
(b ⇒ c) ∧ (c ⇒ a) is equivalent to (b ⇒ c) ∧ a.
This is an algebraic hand-evaluation: a series of formulas joined by ≡. Don't write just portions of previous formulas and mysteriously re-introduce the dropped parts later. For each step, mention which identity you used. It is also helpful if you underline the formula you are rewriting in the next step. You can use commutativity and associativity without using a separate line, but mention when you use it.
In two exercises, you've shown the same equivalence by truth tables (Exercise 2.5.22) and by algebraic identities (Exercise 2.5.27).
- What is an advantage of using truth tables? What is an advantage of using identities?
- In that truth table exercise (Exercise 2.5.22), you also showed two formulas φ and ψ non-equivalent. It is also possible to do so with Boolean algebra rather than truth tables. How?
- Describe a hybrid approach, combining truth tables and Boolean algebra, to prove the equivalence and non-equivalence of formulas.
- To ponder on your own without turning it in: Which approach appeals more to you?
Using Propositional equivalences, rewrite the formula (a ⇒ b ∨ c) ∧¬b to one with fewer connectives.