Course pages 2012–13

Discrete Mathematics II

1. Notes on Set Theory for Computer Science by Prof Glynn Winskel [b/w pdf]


2. Course lecture notes from the Notes on Set Theory for Computer Science [b/w pdf]
   • Abridged Chapter 1
   • Abridged Chapter 2
   • Abridged Chapter 3
   • Chapter 4
     • A note on On Enumerability
     • An answer to Exercise 4.9
   • Abridged Chapter 5
     • An answer to Exercise 5.9


3. Course lecture slides [colour pdf]
   • Lecture 1 (6.II)
   • Lecture 2 (8.II)
   • Lecture 3 (11.II)
   • Lecture 4 (13.II)
   • Lecture 5 (15.II)
   • Lecture 6 (18.II)
   • Lecture 7 (20.II)
   • Lecture 8 (22.II)
   • Lecture 9 (25.II)
   • Lecture 10 (27.II)
   • Lecture 11 (1.III)
   • Lecture 12 (4.III)


4. Suggested exercises
   • From the Notes on Set Theory for Computer Science
     • Chapter 1: 1.5, 1.7
     • Chapter 2: 2.2, 2.8
     • Chapter 3: 3.1, 3.4, 3.5, 3.6, 3.10, 3.12, 3.17, 3.18, 3.21, 3.33, 3.36
     • Chapter 4: 4.4, 4.5, 4.6, 4.7, 4.8, 4.9
     • Chapter 5: 5.1, 5.5, 5.6, 5.7, 5.8, 5.9, 5.10, 5.11, 5.12
   • From the course slides
     • Lecture 5: see slides 3, 10
     • Lecture 6: see slides 3, 4
     • Lecture 7: see slides 5, 8
     • Lecture 9: see slides 20, 27, 28
     • Lecture 11: see slide 14
     • Lecture 12: see slides 7, 9