Recitation 1 This covers Part 2 of the Course Notes. It is due in class on Thursday, Jan. 17.
Recitation 2 This covers Sec. 3.1 of the Course Notes.
Recitation 3 This covers Sec. 3.2 of the Course Notes. This is due in class on Tuesday, Jan. 29.
Recitation 4 This covers Sec. 3.3 of the Course Notes. Problem 1 and parts a-b of problem 2 of this are due in class on Tuesday, Jan. 29.
Recitation 5 This covers Sec. 3.4 of the Course Notes.
Recitation 6 This covers Secs. 4.1-4.3 of the Course Notes. This is due on Thursday, Feb. 7.
Recitation 7 This covers Sec. 4.4 of the Course Notes. This is due on Tuesday, Feb. 12.
Recitation 8 This covers Secs. 5.1-5.4 of the Course Notes. Have the first part sone on Thursday, Feb. 14.
Recitation 9 This covers Sec. 5.5 of the Course Notes. This is due on Tuesday, Feb. 19.
Recitation 10 This covers encoding in predicate logic and abstract programs.
Recitation 11 This covers encoding in predicate logic and typed and constrained quantifiers.
Recitation 12 This covers the use of quantifier inference rules.
Recitation 13 This covers the use of function symbols and equality.
Recitation 14 This covers proof by weak and strong induction.
Recitation 15 This covers proof of logical laws and rules by induction.
Recitation 16 This covers proof of algorithm correctness by weak induction and loop invariants.
Recitation 17 This covers proof of algorithm correctness by strong induction.
These documents are in in PDF format. If you don't have Adobe Acrobat Reader you can download it, at no cost , by following this link: