Lecture 19(Friday) - Part 1 - using uniqueness Suppose you...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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 de ned 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.

Page1 / 2

Lecture 19(Friday) - Part 1 - using uniqueness Suppose you...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online