CS2800: Logic and Computation - Lecture Notes
Fall 2010

[Main Page] [Syllabus] [Homework] [Labs]


We will try to post lecture notes within 24 hours of each lecture. They are meant to augment the textbook and reduce the need to take notes during class.

Lecture
Date
Reading
Lecture 1 (no material for examination) Wed 9/8
Lecture 2 Thurs 9/9
Lecture 3 ( txt) Mon 13/9
Lecture 4 (rev and accumulator style definitions) Wed 15/9
Lecture 5 Thurs 16/9
Lecture 6 (review for exam) Mon 20/9
Lecture 7,8,9,10 (refer Boolean Logic Notes)
Here is an old list of Boolean equalities by Peter Dillinger.
Lecture 11 was a review.
Thurs 23/9 - 10/4
Lecture 12 (refer to Boolean Arithmetic Notes)
Thurs 10/7
Lecture 13 (Intro to First-Order Logic)
Wed 10/13
Lecture 14 (Intro to ACL2 Logic)
Thurs 10/14
Lecture 15 (Theories.Axioms,Rules of Inference)
Monday 10/18
Lecture 16 & 17 (ACL2 Paper Pencil Proofs)
Thurs 10/21 and Mon 10/25
Lecture 18 (Case analysis Proof technique)
Wed 10/27
Lecture 19 (More proofs)
Thurs 10/28
Lecture 20-21 (Intro to Induction)
Mon 11/1 and Thurs 11/4
Lecture 22 (Termination and Induction)
Mon 11/8
Lecture 23 (Two Proof Patterns)
Wed 11/10
Lecture 24(review) (Brief Notes)
Mon 11/15
Lecture 25 (Mechanized Proofs in ACL2(Demo))
Thurs 11/18
Lecture 26 (Rewriting Notes)
Extra Reading: Old lecture notes on the
ACL2 Waterfall, and Rewriting.
Mon 11/22
Lecture 27 (Proofs in ACL2 + Generalization)
Mon 11/29
Lecture 28
(ACL2s session:Coming up with lemmas from checkpoints + Review)
Wed 12/1
Lecture 29
Cool Stuff: Abstract Data Types(Stack eg)
Characterizing it with properties, Replacing implementation etc
Mon 12/6