# Formal Logic

**Recent annoucements:**
The last few exams (beacuse of storm/corona) take place in **U4-135**.
Just show up there at the appointed time.

## Where und When:

- Lecture: Tuesday 14:15-15:45 in H6
- Problem classes:
- Tuesday 16:15-17:45 in U2-135, tutor: Jonas Kalinski, or
- Tuesday 16:15-17:45 in C01-142, tutor: Frederic Alberti
- Wednesday 8:30-10:00 in C01-258, tutor: Simon L Ellinghaus

- Written exam: Thursday 17
^{th} February 2022 at 10:00 in H4
- Duration: 90 min
- Allowed tools: Pen, brain (no own paper, no cheat sheet)
- Typical problems would look like exercises 1, 6, 7, 9, (12), 15,
17, 18, (19), (21), (22), 24, 25, 26, 30, 31, (34), 35, 38, (40), (42),
46, 47, 48, 49, 50, (51).

Here the
link
to the ekvv-entry.

## Topics:

Formal logic appears naturally in several places in computer science.
Logic gates are the elementary building blocks of integrated circuits.
Proofs of NP-hardness often use
reductions to satisfiability of Boolean expressions. Logic provides a
concept of computability, and a wealth of problems that cannot be solved
algorithmically. Propositional and first-order logic, as well as temporal
logic and higher-order logic are used in the verification and validation
of computer algorithms.

This one-semester course offers introduction to advanced topics of formal
logic. After setting the ground by delving into propositional logic, this
course covers first-order logic and modal logic (with some
focus on normal forms and the algorithmic treatment of logic formulas) as
well as concepts and questions about (un-)decidabilty.
## Exercise Sheets

The 2h lectures are accompanied by problem sheets. Solutions to the problem
sheets will be handed in by the students (single, or teams of two) and
discussed in the problem classes. In any case it is important that all
students worked on all exercises, otherwise you will not learn enough.
Any student who presents his/her solution to the problem class gets
one point bonus for the written exam.
## Lecture notes

The lecture notes. Please
let me know if you find any errors, including typos.

**Assessment:** 5 Credit points for solving 50% of the exercises on the
problem sheets, and passing the written exam at the end of the course.
- NWI Bachelor: strukturierte Ergänzung
- BIG Bachelor: Wahlpflicht Bioinformatik (benotet oder unbenotet),
oder strukturierte Ergänzung
- KOI Bachelor: Wahlpflicht Intelligente Systeme, oder
strukturierte Ergänzung
- Informatik Bachelor: Wahlpflicht Informatik, oder
strukturierte Ergänzung
- NWI Master: Grundlagen Ergänzung
- BIG Master: Grundlagen Ergänzung
- ISY Master: Grundlagen Ergänzung

## Videos:

One can find a lot of misleading, false or superficial information
in the web. But there are exceptions:
## Literature:

- Uwe Schöning: Logic for Computer Scientists
- H.-D. Ebbinghaus, J. Flum, W. Thomas: Mathematical Logic
- Wolfgang Rautenberg: A Concise Introduction to Mathematical Logic
- Uwe Schöning: Logik für Informatiker (German)
- Martin Kreuzer, Stefan Kühling: Logik für Informatiker (German)

* Last change 1.3.2022
Dirk Frettlöh
*