COMP 230 Logic and Computability (3 credits)

Note: This is the 2016–2017 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.

Offered by: Computer Science (Faculty of Science)


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 2016

Instructors: Oran Magal (Fall)

  • 3 hours

  • Prerequisite: CEGEP level mathematics.