Discrete Mathematics and LogicModule description #41318 / Version 1
- 6 CP
- Written exam
- Graded
- Winter semester
- German
| Module / Version | #41318 / #1 |
|---|---|
| Validity | Since Winter semester 2026/27 |
| Available language(s) | English, German |
| Credit points | 6 |
| Person responsible for the module | Kreutzer, Stephan |
| Grading | Graded |
| Exam format | Written exam |
| Language(s) of instruction | German |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34352200 FG Logik und Semantik (LaS) |
Contact
| Office | Not specified |
|---|---|
| Contact person | Not specified |
| E-mail address | Not specified |
| Website | Not specified |
Learning outcomes
Graduates of this module are able to understand and assess problems from discrete mathematics. They can apply combinatorial counting methods (e. g., the pigeonhole principle) to support proofs and to analyse algorithms. They are familiar with elementary concepts of number theory. Furthermore, they possess foundational knowledge of graph theory. In particular, they understand classical graph problems such as matching and graph colouring and have a good understanding of concepts of connectivity in graphs and their applications, for example in the field of computer networks. They can exploit properties of special classes of graphs (e. g., bipartite and planar graphs) to solve graph problems.
Graduates of this module also understand the role of logic in computer science as well as its various concrete application areas, such as verification, databases, and artificial intelligence. They are able to explain classical propositional and predicate logic as well as logical calculi and understand the typical structure of a logic as a mathematical theory. They are capable of manipulating logical formulas using algorithmic methods-e. g., converting them into normal forms or testing for satisfiability. They can explain the semantics of predicate-logical expressions and can carry out derivations in proof calculi in a formally correct manner.
Graduates of this module also understand the role of logic in computer science as well as its various concrete application areas, such as verification, databases, and artificial intelligence. They are able to explain classical propositional and predicate logic as well as logical calculi and understand the typical structure of a logic as a mathematical theory. They are capable of manipulating logical formulas using algorithmic methods-e. g., converting them into normal forms or testing for satisfiability. They can explain the semantics of predicate-logical expressions and can carry out derivations in proof calculi in a formally correct manner.
Content
1. Combinatorics
- Counting techniques
- Urn models
- Pigeonhole principle
2. Number Theory
- Modular arithmetic
- Chinese remainder theorem and Euclid’s algorithm
3. Foundations of Graph Theory
- Different types of graphs
- Trees
- Connectivity and higher connectivity in graphs
- Special classes of graphs
- Matchings and colourings
4. Propositional Logic
- Foundations of propositional logic and its role and applications in computer science
- Normal forms
- Algorithmic problems in propositional logic
- Resolution
- The SAT problem
- Algorithmic foundations of SAT solvers and their applications
5. First-Order Predicate Logic
- Foundations of first-order logic and its role and applications in computer science
- Logical concepts such as inference, validity, equivalence, satisfiability
- Normal forms
- Sequent calculi
- Definability in first-order logic
- Counting techniques
- Urn models
- Pigeonhole principle
2. Number Theory
- Modular arithmetic
- Chinese remainder theorem and Euclid’s algorithm
3. Foundations of Graph Theory
- Different types of graphs
- Trees
- Connectivity and higher connectivity in graphs
- Special classes of graphs
- Matchings and colourings
4. Propositional Logic
- Foundations of propositional logic and its role and applications in computer science
- Normal forms
- Algorithmic problems in propositional logic
- Resolution
- The SAT problem
- Algorithmic foundations of SAT solvers and their applications
5. First-Order Predicate Logic
- Foundations of first-order logic and its role and applications in computer science
- Logical concepts such as inference, validity, equivalence, satisfiability
- Normal forms
- Sequent calculi
- Definability in first-order logic
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Diskrete Mathematik und Logik (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Pre/post processing | 15 | 2 h | 30 h |
| 60 h | |||
Diskrete Mathematik und Logik (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Pre/post processing | 15 | 2 h | 30 h |
| 60 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Completing homework | 15 | 2 h | 30 h |
| Exam preparation | 1 | 30 h | 30 h |
| 60 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
* Lectures
* Supervised exercise groups
* Solving assignments in small groups
* Supervised exercise groups
* Solving assignments in small groups
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Basic course in linear algebra, module "formal-mathematical foundations"
Mandatory requirements for the module examination registration:
The examination requirements could not be retrieved.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | German |
| Duration/Extent | 120 minutes |
Exam description
Requirements for the module examination
1. Regular assignments will be set throughout the semester; these must be completed in writing by groups of no more than four students and will be marked. Students will be eligible to sit the module examination if they have achieved at least 50 % of the available points.
2. A one-off 60 min multiple-choice test will be held in person during the second half of the semester. Students will be eligible to sit the module examination if they achieve at least 50 % of the available points.
Students will be informed at the start of the semester which of the two options will be offered in the respective year.
1. Regular assignments will be set throughout the semester; these must be completed in writing by groups of no more than four students and will be marked. Students will be eligible to sit the module examination if they have achieved at least 50 % of the available points.
2. A one-off 60 min multiple-choice test will be held in person during the second half of the semester. Students will be eligible to sit the module examination if they achieve at least 50 % of the available points.
Students will be informed at the start of the semester which of the two options will be offered in the respective year.
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Exercise groups are assigned through the MOSES system in the first week of term. The deadlines are communicated in the lecture and through the ISIS system.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – All teaching material will be made available through the ISIS system.
Recommended literature
No recommended literature given
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Computer Science Computer Science (B. Sc.) - StuPO 2025 | WS 2026/27 | Pflichtbereich › Mathematisch-algorithmisch-konzeptionelle Kompetenzen |
Miscellaneous
Not specified