We will be covering both propositional (AKA boolean) logic and predicate (sometimes called first order) logic. The primary handout was Luger's chapter on Predicate Logic; the first section also covers Propositional Logic. There is also some material on propositional logic in both the Discrete Math and Computer Architecture textbooks and a brief introduction to Predicate Logic in both of the Prolog handouts.
Not yet triaged for specific course pointers
Wikipedia: Logic; (server down, will review when back up)
Wikipedia: Predicate Logic, decent
Truth Tables; most truth table pages were horrible, this one is okay. Photocopies from a logic text are probably a better bet for truth tables.
Wikipedia: Truth Tables, see previous
UGAI Intro to Logic, actually pretty good, if a bit glossed
Arguments and Proofs - From a logic course somewhere. LOTS of examples at the bottom of the page showing how to give justification for each line of the proof. Uses one weird rule, Switcheroo, which switches between (a=>b) and (-a OR b).
Incompleteness and Paradox
This is the beginning of a list of resources on incompleteness, a topic we're covering at least a little bit in the course. It is also related to ReadingRoom/TuringMachines.
- Handouts in class, particularly Smullyan.
Denton's page is more about the theorem than on it, but the excerpt from Rucker is a nice summary of the key insight.
Wikipedia: Godel's Incompleteness Theorem is an excellent reference.
Godel's paper for those who like to read things in the original (well, translated anyway).