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 2015
Instructors: Schlimm, Dirk (Fall)
3 hours
Prerequisite: CEGEP level mathematics.