This unit covers central results about the nature of logic, the nature of computation, and the relationships between the two. Topics treated include basic set theory, Turing machines, the theory of computability and uncomputability, the decision problem for first order logic, Tarski's theorem on the indefinability of truth, and Gödel's famous incompleteness theorem.
1x2-hr lecture/week, 1x1-hr tutorial/week
2x1000wd assignments (problem sets) (2x25%) and 1x2hr exam (50%)
PHIL1012 or PHIL2628 or permission of instructor