EECS 1019 Study Guide - Midterm Guide: Universal Instantiation, Modus Ponens, Contraposition

• School: York University
• Department: Electrical Engineering and Computer Science
• Course: EECS 1019
• Professor: All

Document Summary

Instructor: s. datta: (6 points) propositional logic (a) (3 points) write down the truth table for the following proposition. (p q) r. T (b) (3 points) state the converse, contrapositive and inverse of the following statement: a positive integer is a prime only if it has no divisors other than 1 and itself . Solution: as discussed in class, this is the equivalent to if a positive integer is prime then it has no divisors other than 1 and itself . Contrapositive: if a positive integer has a divisor that is not 1 or itself, then it is not prime. Inverse: if a positive integer is not prime then it has divisors other than 1 and itself. Note: we know that the contrapositive and inverse are not equivalent in general. Solution: use a truth table. q r p r (p r) (q r) (p q) (p q) r q p r.