Spring 2020 - CMPT 701 G100

Computability and Logic (3)

Class Number: 6752

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 6 – Apr 9, 2020: Mon, Wed, Fri, 12:30–1:20 p.m.
    Burnaby

  • Exam Times + Location:

    Apr 19, 2020
    Sun, 12:00–3:00 p.m.
    Burnaby

Description

CALENDAR DESCRIPTION:

Deep connections between logic and computation have been evident since early work in both areas. More recently, logic-based methods have led to important progress in diverse areas of computing science. This course will provide a foundation in logic and computability suitable for students who wish to understand the application of logic in various areas of CS, or as preparation for more advanced study in logic or theoretical CS.

COURSE DETAILS:

This course is cross-listed with CMPT 409 Modern logic grew out of efforts to provide a formal foundation for mathematics in the early 20th century, at the centre of which are fundamental results by Godel, Turing, and other luminary figures, establishing close ties between logic and computation. Logic has turned out to be a powerful tool in computer science, and most working logicians today are computer scientists. This course will provide an introduction to basic results in logic and computability, including Godel's Incompleteness theorems.

COURSE-LEVEL EDUCATIONAL GOALS:

  • Propositional Logic
  • First-Order Logic
  • Proof Systems
  • Computability
  • Recursive and Recursively Enumerable Sets
  • Goedel's Incompleteness Theorems

Grading

NOTES:

To be discussed in the first week of classes.

Materials

MATERIALS + SUPPLIES:

  • Computability and Logic - Course Notes, provided by the instructor, Stephen A. Cook, 0000000000000, These notes will be available from the course web page.
  • A Mathematical Introduction to Logic, 2nd Edition., Herbert B. Enderton, Elsevier, 2001, 9780122384523
  • Introduction to the Theory of Computation, Michael Sipser, Cengage, 2012, 9781133187790

REQUIRED READING:

  • Computability and Logic - Course Notes, provided by the instructor, Stephen A. Cook, 0000000000000, These notes will be available from the course web page.

RECOMMENDED READING:

  • A Mathematical Introduction to Logic, 2nd Edition., Herbert B. Enderton, Elsevier, 2001, 9780122384523
  • Introduction to the Theory of Computation, Michael Sipser, Cengage, 2012, 9781133187790

Graduate Studies Notes:

Important dates and deadlines for graduate students are found here: http://www.sfu.ca/dean-gradstudies/current/important_dates/guidelines.html. The deadline to drop a course with a 100% refund is the end of week 2. The deadline to drop with no notation on your transcript is the end of week 3.

Registrar Notes:

SFU’s Academic Integrity web site http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating.  Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the University community.  Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS