NOTE: This assignment is due by 5:00 pm on Friday, April 29, 2011. As I will be in and out of my office before 5:00 pm that day, please turn in your assignment by giving it to me ahead of time during my office hours or by sliding it under my office door if I am not in my office when you turn it in. Do not send assignments to me through email or leave them in my departmental mail box.
When doing induction on n it is not always possible to prove P(n+1) using only P(n) in the induction step. In particular, it may be necessary to use one or more other P(m), where m < n. Fortunately, this is exactly what strong induction allows us to do. To understand strong induction, it is import to gain experience with it.
The goal of this assignment is to give you experience with strong induction.
Prove Theorem mT from Lecture 19.
Prove Theorem dS from Lecture 19.
Prove Corollary dR from Lecture 19.
Prove Corollary "bits in word" from Lecture 21.
For the sake of this proof, you may use the following definition of take:
take:: Int ⇒ a → [b] → [b] | |
take n [] = [] | {take[]} |
take 0 xs = [] | {take_{0}} |
take (n+1) (x:xs) = x: (take n xs) | {take_{n+1}} |
Prove thmHalfAdder from Lecture 21.
The following words of advice come directly from Prof Page who has taught this course many times. Please pay them great heed!
Warning! For almost all people, the most effective way to work on proofs is to distribute the work over several days. Work a couple hours a day, every day, on the problems. When you’ve worked a good while on one of the problems and find yourself stuck, try another problem. Eventually, problem by problem, you will discover a key that leads to a solution. It may seem that key comes to you suddenly, but somehow the hard work invested before the epiphany gradually builds the picture in your mind until the solution pops out. If you start working on this homework assignment the day before it’s due, you probably won’t finish it. That means you will have missed one of your only real opportunities to prepare for the examinations in this course.
Importance of Finding Your Own Keys. Each problem that you fail to invest enough time in to find the key yourself reduces, substantially, your chances of passing the exams in this course. I advise you not to discuss a problem with someone else until you have found the key. If you have questions about the material, ask the instructor or the assistant. Email should work well for this. I don’t regard discussing the problems with others as cheating, as long as can explain to me whatever you turn in, but I want you to know that the more you rely on such discussions, the less likely it is that you will succeed on the exams.
Important Alert! Homework problems provide your only real opportunity to study for exams. Studying the night before the exam will be of almost no use at all. If you have difficulties, come to see the Instructor or Teaching Assistant during office hours.
How Much Time Will This Homework Take? Some of the problems may take hours to complete. Others, only a few minutes. Some problems may seem difficult to you that seem easy to others, and vice versa. There is no way to predict when or how the insights you will need to solve these problems will come to you. Also, expect some frustration in the process of using the proof checker. Just as in programming, you have to get all the required characters in the right order. All the commas, parentheses, case-sensitive names, etc have to be right. It can easily take an hour to get an already correct proof pushed through the proof checker.
Recall that you can use as rules in your proofs equations other than those on your handout sheet, provided that those equations have already been proven (in class or in your homework) and that the proof of the equation does not cite, directly or indirectly, the equation you are proving. An equation is "indirectly cited" if it is cited, directly or indirectly, in the proof an equation you are citing.
Don’t forget that a metavariable (such as ‘a’ or ‘b’ in a rule, whether from Natural Deduction, Equational Reasoning, or Induction) can stand for any WFF, not just a single variable. For example, you know that you could use {∧E_{R}} with ∀x.f(x) ∧ ∃y.g(y) to derive ∀x.f(x) by substituting ∀x.f(x) for ‘a’ and ∃y.g(x) for ‘b’ in the rule. However, don’t forget that you could use {∧E_{R}} with ∀x.f(x) ∧ (∃y.g(y) ∧ (¬∃z.h(z) ∧ (¬∀w.i(w) ∨ (j(x) → k(y)) ∨ l(z)) ∧ m(a))) to derive ∀x.f(x) as well, simply by substituting ∀x.f(x) for ‘a’ and ∃y.g(y) ∧ (¬∃z.h(z) ∧ (¬∀w.i(w) ∨ (j(x) → k(y)) ∨ l(z)) ∧ m(a)) for ‘b’ in the rule.
You will turn in a typed or neatly written hard copy of your homework that shows all the work specified above. You will not need to submit anything electronic for this homework.