This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: using uniqueness Suppose you have a predicate of the natural numbers: Is S (3 3) true? How do you prove that? It's useful to check out the remainder theorem from the sheet of mathematical prerequisites. Vn P N S (n) D Wk P N; n = 7k + 3 slide 4 getting wrong right Be careful proving a claim false. Consider the claim, for some suitably dened X; Y and P; Q:
S : Vx P X; Vy P Y; P (x; y) A Q(x; y) To disprove S , should you prove: Vx P X; Vy P Y; P (x; y) A XQ(x; y)
What about Vx P X; Vy P Y; X (P (x; y) A Q(x; y)) Explain why, or why not. slide 5 ...
View
Full
Document
This note was uploaded on 10/13/2011 for the course COMPUTER S CSC 165 taught by Professor Dannyheap during the Fall '10 term at University of Toronto.
 Fall '10
 DannyHeap
 Computer Science

Click to edit the document details