Winter 2018

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.

Prereqs: (One of CS136, CS138, CS146), MATH135; Honours Mathematics students only.