Logic 2, Spring 2025
On this page, you may find the specifics to the Logic 2 course. Please refer to Logic for information on where to find the lecture notes, how to communicate with the teaching team and the general setup of this and the Logic 1 course.
The course will be organised as follows. Throughout the semester, there are 7 lectures and 6 exercise classes, see the Course Schedule for details. You will have to submit homework assignments and the grade of the homework will make 30% of your final grade, Logic for details. The course will end with an exam, which makes 70% of your final grade, see the Exam section below.
Course Schedule
The lectures take place weekly in Gorlaeus BW.0.32 according to the timetable below, while the exercise classes take are in various rooms, see Practical Rooms below. The homework deadlines will be available on Brightspace.
Here is the timetable of the course, numbered by semester week:
Week | Practical | Lecture |
---|---|---|
9 | None | Lecture 1 (Thu, 03 Apr, 13:15) |
10 | Wed, 09 Apr, 15:15 | Lecture 2 (Thu, 10 Apr, 13:15) |
11 | Wed, 16 Apr, 15:15 | Lecture 3 (Thu, 17 Apr, 13:15) |
12 | Wed, 23 Apr, 15:15 | Lecture 4 (Thu, 24 Apr, 13:15) |
13 | Wed, 30 Apr, 15:15 | Lecture 5 (Thu, 01 May, 13:15) |
14 | Wed, 07 May, 15:15 | Lecture 6 (Thu, 08 May, 13:15) |
15 | Wed, 14 May, 15:15 | Exam Preparation (Thu, 15 May, 13:15) |
Exam
The exam and retake take place in the University Sports Centre are scheduled for
- Thu, 19 Jun, 13:00 in Gorlaeus Building - BW.0.08 and
- currently unknown.
The exam will take place in ANS and you have 3 hours to complete it. You may find instructions with the exam in ANS, and an example of how the exam looks like on Brightspace.
During the exam, you will be using Proof Rondo. So make sure to be fluent in using it.
Practical Rooms
We will be using the room Gorlaeus Building - BW.0.39 for exercise classes.
Lectures
Lecture 1
(Chapter 8 of the Logic Rondo)
Labelled trees and their induction principles, iteration and induction for formulas
Lecture 2
(Chapter 9 of the Logic Rondo)
FOL with equality including natural deduction system ND₁ and cND₁, uniqueness quantifier
Lecture 3
(Chapter 10 of the Logic Rondo)
Models of FOL, Semantics of terms, Boolean semantics of formulas, Substitution lemma, soundness
Lecture 4
(Chapter 11 of the Logic Rondo)
Semantic equivalence, completeness for cND₁, compactness, Reachability not expressible
Lecture 5
(Chapter 12 of the Logic Rondo)
Computable functions, axiomatisations, primitive recursion and primitive recursive arithmetic
Lecture 6
(Chapter 13 of the Logic Rondo)
Expressing provability inside FOL, Gödel’s Incompleteness Theorems
Lecture 7
Summary and exam preparation