Course syllabus
Course-PM
DAT060 / DIT202 Logic in Computer Science
LP1 HT22 (7.5 hp)
The course is offered by the department of Computer Science and Engineering.
News
Here we will publish news if there are any...
Contact Details
- Examiner and lecturer: Ana Bove <bove @ chalmers.se>
- Lecturer: Thierry Coquand <coquand @ chalmers.se>
- Teaching assistant:
- Jeremy Pope <popje @ chalmers.se>
- Nachiappan Valliappan <nacval @ chalmers.se>
Course Purpose
Powerful tools for verifying software and hardware systems have been developed. These tools rely in a crucial way on logical techniques. This course provides a sound basis in logic and a short introduction to some logical frameworks used in modelling, specifying and verifying computer systems. A sound basic knowledge in logic is a welcome prerequisite for courses in program verification, formal methods and artificial intelligence.
Schedule
See TimeEdit and/or course calendar.
Overview of Topics and Reading Material per Week
| Week | Topics | Reading Material/Book Sections |
| 1 | Recap logic, sets, relations, functions, induction | sets relations functions notes on induction Structural induction Note: There are 2 typos in the second page on set theory; the right most B in the distributive laws (1) and (2) should be an A. 1.4.2 |
| 2 | Natural deduction for propositional logic | 1.1-1.3 |
| 3 | Semantics of propositional logic, normal forms | 1.4-1.5 except 1.4.2 |
| 4 | Natural deduction and semantics for predicate logic | 2.1-2.4 |
| 5 |
Undecidability of predicate logic and Post correspondence problem |
2.5 |
| 6 |
Expressivity of predicate logic, compactness, Gödel's incompletness theorem |
2.6, 3.2 |
| 7 | LTL, CTL | 3.2-3.5 |
| 8 |
Guest lecture on temporal logic. Repetition, old exams |
3.6-3.7 |
Exercises
Week 1: exercises1.pdf
Weeks 2--8: exercises2-8.pdf
Course Literature
Logic in Computer Science by Michael Huth and Mark Ryan, second edition.
See http://www.cs.bham.ac.uk/research/lics/
Exercises marked with an asterisk ("*") in the text book have solutions.
(There used to be an electronic version of the book available via Chalmers library, please check!)
Course Design
The course consists of a series of lectures and exercise sessions.
The language of instruction is English.
Changes Made since the Last Occasion
We will run the course fully on campus this year, besides this, no major changes from last year.
We will try to offer the two guest lectures that were offered last year (or similar ones) to better show the applications of the course, but this will depend on the availability of the teachers that could give these lectures.
Learning Objectives and Syllabus
After completing the course the student is expected to be able to:
Knowledge and understanding:
- explain when a given formula is a tautology,
- explain the notion of model of a first-order language and of temporal logic,
- explain when a first-order and a temporal logic formula is semantically valid,
- explain how to check if a branching-time temporal logic formula is valid in a given model,
- explain the meaning of the soundness and completeness theorems for propositional and predicate calculus.
Competence and skills:
- write and check proofs in natural deduction for propositional and predicate calculus,
- specify properties of a reactive system using linear-time temporal logic and branching time temporal logic.
Judgement and approach:
- judge the relevance of logical reasoning in computer science, i.e. for modelling computer systems,
- analyse the applicability of logical tools to solve problems in computer science, i.e. finding bugs with the use of model checking.
Link to the syllabus on
- Chalmers Studieportalen Study plan
- Göteborgs Universitet Course plan
Examination Form
The course is examined by an individual written exam taking place in an examination hall at the end of the course. It is not allowed to have any help material but dictionaries to/from English.
The exams has a maximum of 60 points and the passing grades in the exam are as follow:
| Chalmers | |
| GU |
Note:
When making a natural deduction proof in the exam you are allowed to use any of the rules presented in page 27 of the book plus the introduction and elimination rules for both the universal and existential quantifiers, unless it is stated otherwise in an exercise.
In other words, you are allowed to use all introduction and elimination rules (including those for double negation) and the derived rules MT, PBC and LEM, unless stated otherwise.
No other result can be used unless it is proved.
Non-obligatory assignments:
There will be 6 non-obligatory individual assignments with a total of 60 to 65 points. The first five assignment have 10 points and the last one has 10 to 15 points. 10% of the total number of points obtained with the assignments count as bonus points in the written exam. These bonus points are valid for the whole academic year 22/23.
Solution to the assignments will be discussed in the Friday exercise session after the submission.
All submissions must include name, and personal number and should be uploaded in Canvas. The solutions must be clear and readable; everything must be carefully motivated!
As always in life, one should not cheat! Any suspicious on cheating will be taken seriously and must be reported to the Disciplinary Committee for further investigation.
Exam dates for 2022/2023: 24th Oct 2022 morning, 3rd Jan 2023 afternoon, 14th Aug 2023 afternoon.
Course Evaluation
Student Representatives
CTH
Anton Levinsson <anton.levinsson @ gmail.com>
Carl Ridderstolpe <carl.ridderstolpe @ hotmail.com>
Arvid Rydberg <riddarvid @ gmail.com>
Selina Sand Engberg <selinasandengberg @ gmail.com>
Zilong Wang <Tredson0116 @ gmail.com>
GU
Erik Dagobert <gusdagoer @ student.gu.se>
Elin Melander <gusmelelb @ student.gu.se>
Albin Otterhäll <gusalbiot @ student.gu.se>
Meetings
First meeting: Friday 16th of September, 15:15. protocol1.txt
Second meeting: Thursday 13th of October, 15:15. protocol2.txt
Course summary:
| Date | Details | Due |
|---|---|---|