# Logic and Computability

### Table of Content

## Content

In this course, you will learn to understand logic formulas, to use concise mathematical notations, to formulate and solve problems in formal languages, and to reason with logics manually and algorithmically. We will teach logic proof systems, and you will gain the ability to construct logic proofs on your own and you will master common proof techniques of computer science. Finally, we discuss the fundamental limitations of the computing abilities of computers and discuss selected decision problems and the underlying algorithms.

The content of this lecture includes:

- Syntax and semantics of logic formulas in propositional logic and predicate logic (first-order logic)
- Basics of logical reasoning (natural deduction)
- Combinational equivalence checking
- Propositional satisfiability problem - DPLL algorithm - Resolution proofs
- Binary Decision Diagrams
- Decidability, Halteproblem
- First-Order Theories
- Satisfiability modulo Theories

## Material

You can find the current material here.## Administrative Information

**Previous Knowledge**

**Prerequisites Curriculum**

**Objective**

**Language**

**Teaching Method**

**How to get a grade**

**Registration**

## Exams

Course | Date | Begin | End | Slots | Location |
---|---|---|---|---|---|

Lehrveranstaltungsprüfung | 2021/02/05 | 11:00 | 14:00 | 0/35 | |

Lehrveranstaltungsprüfung | 2020/12/01 | 10:30 | 13:30 | 8/35 | |

Lehrveranstaltungsprüfung | 2020/10/27 | 10:30 | 13:30 | 35/35 | |

Lehrveranstaltungsprüfung | 2020/09/07 | 09:00 | 12:00 | 23/35 |