COMP 1805 Lecture 5: COMP 1805A - Lecture Notes 05 - 2016-09-22

• School: Carleton University
• Department: Computer Science
• Course: COMP 1805
• Professor: Robert Don Collier

Document Summary

For example, show using truth tables that is the same as p q (p q) p. F p q p q q) (p p q. As another example, we can rewrite equivalence using truth tables: p q using only as p ( q q (p and can prove the p. F p q p q p q. T ( q q p (p. For example, we can prove that implication is only false when the antecedent is true and the consequent is false, but is false. p ( q p is a tautology using a truth table. This makes sense because p q will only be false if p p q p q p ( q p. We can prove that p q which means this statement can never be false. p ( q ( p is true when and have the same value, but.