Participation
Please register for the course to gain access to the Adam workspace.
We teach the course as flipped classroom with prerecorded lectures, an exercise on Monday and a plenary meeting on Wednesday.
Lecture Slides
| No | Topic | Study until | Slides |
|---|---|---|---|
| A1 | Organizational Matters | 21.9. | screen print 4 print 1 |
| A2 | Proofs I Examples | 26.9. | screen print 4 print 1 tex |
| A3 | Proofs II Examples | 3.10. | screen print 4 print 1 tex |
| B1 | Sets I | 3.10. | screen print 4 print 1 |
| B2 | Sets II: Countable Sets | 10.10. | screen print 4 print 1 |
| B3 | Sets III: Cantor's Theorem | 10.10. | screen print 4 print 1 |
| B4 | Tuples and Cartesian Product | 10.10. | screen print 4 print 1 |
| B5 | Relations | 10.10. | screen print 4 print 1 |
| B6 | Equivalence and Order Relations | 17.10. | screen print 4 print 1 |
| B7 | Operations on Relations | 17.10. | screen print 4 print 1 |
| B8 | Functions | 24.10. | screen print 4 print 1 |
| B9 | Permutations | 24.10. | screen print 4 print 1 |
| B10 | Groups | 31.10. | screen print 4 print 1 |
| B11 | Divisibility & Modular Arithmetic | 31.10. | screen print 4 print 1 |
| C1 | Introduction to Graphs | 07.11. | screen print 4 print 1 |
| C2 | Paths and Connectivity | 07.11. | screen print 4 print 1 |
| C3 | Acyclicity | 14.11. | screen print 4 print 1 |
| C4 | Further Topics in Graph Theory | 14.11. | screen print 4 print 1 |
| D1 | Introduction to Recurrences | 21.11. | screen print 4 print 1 |
| D2 | Advanced Methods for Recurrences | 21.11. | screen print 4 print 1 |
| E1 | Introduction to Formal Logic | 28.11. | screen print 4 print 1 |
| E2 | Properties of Propositional Formulas | 28.11. | screen print 4 print 1 |
| E3 | Normal Forms and Logical Consequence | 5.12. | screen print 4 print 1 |
| E4 | Inference | 5.12. | screen print 4 print 1 |
| E5 | Syntax and Semantics of Predicate Logic | 12.12. | screen print 4 print 1 |
| E6 | Advanced Concepts in Predicate Logic and Outlook | 12.12. | screen print 4 print 1 |