CMPT 260 Mathematical Logic and Computing

Description

An introduction to elementary applied propositional and predicate logic. Fundamental proof techniques with an emphasis on induction. The theory of sets, relations and functions. Course concepts are related to Computer Science areas, with an emphasis on relational databases. 

Prerequisites

  • CMPT 115 or 117, and MATH 110.

Instructor

Office Hours

If you want an explanation of something or to discuss some topic with me, the best time to access me is immediately after class, in the class room or hallway outside the classroom. If you are unable to stay long enough for your discussion or it needs to be a private discussion, then after class make an appointment to meet with me at another time. An appointment can also be made via email. If you have a question or questions, the best way to obtain a quick answer is via moodle (http://moodle.cs.usask.ca/). Moodle is also a good place for a public discussion of some topic.

Schedule

  • Tuesday & Thursday, 10:00am - 11:20am

Course Materials

Textbook
  •  Logic and Discrete Mathematics: A Computer Science Perspective, by Winfried Grassmann and Jean-Paul Tremblay, Prentice-Hall, 1966.
Files & Discussion

Mark Allotment

  • Assignments - 25% in total
    • 5-6 assignments, with one involving SQL programming
  • Examinations - 75% in total
    • 1 midterm exam - 25%
    • final exam - 50%
Note that to pass the course, students are required to achieve an aggregate mark of at least 40% on examinations in the course.

 

IMPORTANT! Please read:
1) All students must be properly registered in order to attend lectures and receive credit for this course.
2) Failure to write the final exam will result in failure of the course.
3) Failure to complete required course work will result in failure of the course.


Course Outline

  1. Introduction and Overview - 1/2 lecture
  2. Propositional Calculus - 3 lectures
  3. Predicate Calculus - 3 lectures
  4. Proof Methods - 2 lecture
  5. Induction - 3 lectures
  6. Sets and Relations - 3 lectures
  7. Relational Databases - 5 lectures
  8. Functions - 1 lecture
  9. Proving Program Correctness - 2 lectures
  10. further courses - 1/2 lecture

 

Department Policy on Academic Honesty

Students are expected to be academically honest in all of their scholarly work, including course assignments and examinations. Academic honesty is defined and described in the Department of Computer Science Statement on Academic Honesty at the site
http://www.cs.usask.ca/undergrad/honesty.php

All cases of academic dishonesty are treated according to the University Policy, which can result in strict academic penalties (see
http://www.usask.ca/university_secretary/honesty/StudentAcademicMisconduct.pdf)

Missed Examinations

1) "Students who have missed an exam or assignment must contact their instructor as soon as possible. Arrangements to make up the exam may be arranged with the instructor. Missed exams throughout the year are left up to the discretion of the instructor if a student may make up the exam or write at a different time. If a student knows prior to the exam that she/he will not be able to attend, they should let the instructor know before the exam."

2) "Final exams of a student who is absent from a final examination through no fault of his or her own, for medical or other valid reasons, may apply to the College of Arts and Science Dean's office. The application must be made within three days of the missed examination along with supporting documentary evidence. Deferred exams are written during the February mid-term break for Term 1 courses and in early June for Term 2 and full year courses."