CPSC 121 Study Guide - Midterm Guide: First-Order Logic, Contraposition, Universal Instantiation

• School: UBC
• Department: Computer Science
• Course: CPSC 121
• Professor: All

Document Summary

For each of the following statements: rewrite the statement using predicate logic, write down all of the proof strategies (from the list given below), that are appropri- ate to use to prove the statement. Note that you must not prove the statement. You just need to suggest all the proof strate- gies which can be used to prove it. For any three integers a, b and c, if a divides b and b divides c then a divides c. use. Z to represent the set of integers, and predicate divides(x, y) for x divides y . A z b z c z, divides(a, b) divides(b, c) divides(a, c) Possible proof strategies are c, f and g. For any positive real numbers x and y, x+y xy. Use r+ to represent the set of all positive real numbers. X r+ y r+, x + y. [2] c. there is a perfect square that is the sum of two perfect squares.