Vue d'ensemble
Informatique (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.
Trimestres : Automne 2015
Charg茅s de cours : Schlimm, Dirk (Fall)
3 hours
Prerequisite: CEGEP level mathematics.