Participation
Please register for the course to gain access to the Adam workspace.
Lecture Slides
No | Topic | Date | Slides |
---|---|---|---|
A1 | Organizational Matters | 18.9. | screen print 4 print 1 |
A2 | Sets: Foundations | 23.9. | screen print 4 print 1 |
A3 | Proofs: Introduction | 23.9. | screen print 4 print 1 |
A4 | Proofs Techniques I | 25.9. | screen print 4 print 1 |
A5 | Proof Techniques II | 30.9. | screen print 4 print 1 solution |
B1 | Tuples & Cartesian Product | 2.10. | screen print 4 print 1 |
B2 | Relations | 7.10. | screen print 4 print 1 |
B3 | Equivalence and Order Relations | 7.10./9.10. | screen print 4 print 1 |
B4 | Operations on Relations | 14.10. | screen print 4 print 1 |
B5 | Functions | 16.10./21.10. | screen print 4 print 1 |
B6 | Sets: Comparing Cardinality and Hilbert’s Hotel | 23.10. | screen print 4 print 1 |
B7 | Sets: Countability | 28.10. | screen print 4 print 1 |
B8 | Cantor's Theorem | 30.10. | screen print 4 print 1 |
B9 | Divisibility & Modular Arithmetic | 4.11. | screen print 4 print 1 |
C1 | Introduction to Graphs | 6.11. | screen print 4 print 1 |
C2 | Paths and Connectivity | 11.11. | screen print 4 print 1 |
C3 | Acyclicity | 11.11./13.11. | screen print 4 print 1 |
C4 | Further Topics in Graph Theory | 18.11./20.11. | screen print 4 print 1 |
D1 | Syntax and Semantics of Propositional Logic | 20.11./25.11. | screen print 4 print 1 |
D2 | Properties of Formulas and Equivalences | 25.11./27.11. | screen print 4 print 1 |
D3 | Normal Forms and Logical Consequence | 2.12./4.12. | screen print 4 print 1 |