PHL348H1: Logic and Computation

Hours: 
36L

Topics will include Kurt Gödel's celebrated incompleteness theorems, the technical ideas and methods involved in proving them, their relation to the abstract theory of computation, and their philosophical implications. Are there mathematical truths that cannot be known? Are mathematical concepts such as number and set indeterminate to some extent? Are there limits to what can be modeled formally?

Prerequisite: 

PHL245H1/​MAT157Y1 and a full course in PHL/CSC/MAT

Exclusion: 
Distribution Requirements: 
Humanities
Breadth Requirements: 
Thought, Belief and Behaviour (2)