Propositional and predicate logic. Soundness and completeness and theirimplications. Unprovability of formulae in certain systems. Undecidability of problems in computation, including the halting problem. Reasoning about programs. Correctness proofs for both recursive and iterative program constructions. [Note: Enrolment is restricted; see Note 1 above. Offered: F,W,S] Prereq: (CS 136, 145 taken in fall 2010 or earlier or CS 146), MATH 135; Honours Mathematics students only. Antireq: PMATH 330, SE 112/212
