Course Descriptions - Topics in Logic and Computation MATH 4680   Topics in Logic and Computation
This course covers topics of current interest in logic and/or the foundations of computation. Suitable topics include: formal logic, soundness and completeness, Gödel's incompleteness theorem, formal set theory, the Zermelo-Fraenkel axioms, non-standard models, independence of axioms, lambda calculus and foundations of functional programming languages, proof theory, semantics.
NOTES: Please consult the instructor for the topics offered in a particular year. This course is suitable for advanced undergraduates and graduate students from both mathematics and computer science.
FORMAT: Lecture
PREREQUISITES: MATH 3032.03, or MATH 3502.03, or MATH 3031.03 and MATH 3501.03, or CSCI 3110.03 and CSCI 3136.03, or permission of the instructor.
Suggested prerequisites for math students are algebra or analysis at honours undergraduate level. Students from computer science should be familiar with formal language theory and concepts of programming languages. All students should be comfortable with writing mathematical proofs. When in doubt about prerequisites, please consult the instructor.