COMP 1002 -- Introduction to Logic for Computer Scientists, Winter 2019

Announcements | Course information | Assignments | Labs | Slides


older announcements...


Course information

Course website: . Also see Brightspace (D2L) .

Instructor: Antonina Kolokolova , email:[Your browser cannot view this email address] , office ER-6033.

Lectures Monday, Tuesday and Thursday, 1pm-1:50pm in EN 1054
Labs: Monday (section 1) / Wednesday (section 2) 9am-11:50am in CS-1019.
Instructor office hours: Tuesday/Thursday 2:30pm-3:30pm, in ER-6033.

Textbook: (not required) Discrete Mathematics and Its Applications: Kenneth H. Rosen.
Reference book: Discrete Mathematics With Applications: Susanna S. Epp

Marking scheme: Lab quizzes 24% total (lowest mark dropped), 6 assignments of 5% each, a midterm test 15% and a final exam 31%. Note that the last assignment may be due during the last week of the semester (to provide adequate preparation for the final exam).

Course description
Logic has been called the "calculus of computer science": just as sciences such as physics that deal with continuous realm rely on calculus techniques, we rely on logic. Indeed, so many areas of our field are based on logic: from designing circuits to determining complexity of problems; from verifying correctness of algorithms and devising database queries to automated reasoning in artificial intelligence.

This course is intended to be an introduction to mathematical logic with emphasis on Computer Science applications and methodologies. We will cover propositional and predicate logic with applications, including the Resolution proof technique, which is the basis of most modern-day automated problem solvers. Then we will discuss basic proof techniques such as mathematical induction, again with computer science applications. We will also touch upon basic combinatorics, counting methods and probability, and theory of computation.



Labs start on Jan 21st (Section 2) and Jan 23rd (Section 1). Every lab will end with a quiz; the lowest quiz mark will be dropped. You have to be in the lab to write the quizzes.



Assignment 1. ( LaTeX , EazyTeX , Markdown , HTML ) Due Jan 24, at 10pm.
Assignment 2. ( LaTeX , EazyTeX , Markdown , HTML ) Due Feb 5, at 10pm.
Assignment 3. ( LaTeX , EazyTeX , Markdown , HTML ) Due Feb 16, at 10pm.
Assignment 4. ( LaTeX , EazyTeX , Markdown , HTML ) Due March 12, at 10pm.
Assignment 5 ( LaTeX EazyTeX , Markdown , HTML ) Due March 21, at 10pm.
Assignment 6 ( LaTeX EazyTeX , Markdown , HTML ) Due April 1, at 10pm.

Please type up your assignments and upload them on Brightspace (D2L) as a pdf file; please also upload your source file. There are four source files that you can start with: LaTeX, EazyTeX, Markdown and HTML. I typeset assignments in LaTeX; Overleaf is a good online editor for LaTeX. If you prefer a more WYSIWYG interface, EazyTeX is a new lightweight LaTeX editor designed for students; use the EazyTeX source file there and check D2L for the EazyTeX license for our class. If you want something intermediate, Markdown is a popular language (used e.g. for Github documentation), and it can handle LaTeX-style mathematics; StackEdit is a nice online Markdown editor which can handle LaTeX-style mathematics. Finally, HTML supports LaTeX-style math (with "MathJax" script), as in the source.

Late assignment policy: For every assignment there will be 12 hours after the deadline when assignments would still be accepted, but the marks will be decreased by 10% of the total mark (e.g. a 100-point assignment will receive 10 points less if submitted within 12 hours after the deadline). After this 12-hour period, no assignments will be accepted. If there are several submissions, only the latest will be considered.

Policy on collaboration: The work you submit must be your own. You may discuss problems from assignments with each other; however, you should prepare written solutions alone. Plagiarism is a serious academic offense and will be dealt with accordingly.



I will be posting slides as we go; you are welcome to check the slides and other materials from the previous semester. Here is the A study guide for the midterm and for the final exams
Here is a guide from a famous mathematician Polya on how to approach solving problems.