Note: This is the 2019–2020 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or .
Overview
Computer Science (Sci) : Propositional Logic, predicate calculus, proof systems, computability Turing machines, Church-Turing thesis, unsolvable problems, completeness, incompleteness, Tarski semantics, uses and misuses of Gödel's theorem.
Terms: Fall 2019
Instructors: Schlimm, Dirk (Fall)
3 hours
Prerequisite: CEGEP level mathematics.
