Topics in Logic and Computation

3 credits · Undergraduate

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. CALENDAR 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. COREQUISITES: 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. CROSSLISTED: MATH 5680.03 FORMATS: Lecture