After successful completion of the course, students are able to...
In the practice part, the more complex proofs are considered, including application cases from computer science (e.g. induction proofs for the termination of recursive programs).
The course consists of a lecture part and an exercise part. In the lecture part, proof techniques are discussed, which can then be applied independently to exercises in the exercise part.
ECTS breakdown:
VLecture part (ca 2.5 ECTS):
24h in class and 36h preparation (before and after the lecture).
Exercise part (ca 3.5 ECTS):
90h Development of proofs including the documentation, presentation in exercise groups and review of proofs developed by other students.
Elaboration of proofs including their documentation, presentation in exercise groups and peer review of proofs from other students.
The student has to be enrolled for at least one of the studies listed below
Kursunterlagen (Folien, Aufgabensammlung,...) werden im tuwel-Kurs bereitgestellt
First experiences with definitions, predicate logic, formalization and proofs.
Mathematics knowledge from algebra and discrete mathematics,
Recursion as a programming technique (e.g. from algorithms and data structures).