Discrete Structures IIFDA141, 2005VT
CUGS, ECSEL, PhD students in computer science
The course was last given
Provide a deepened understanding of core concepts vital for
computer science and which are typically not covered by
introductory courses in discrete mathematics.
Introductory courses in discrete mathematics and formal languages and automata theory.
Well-founded sets and ordinals
Inductive definitions and proofs,
- Well-founded induction
- Transfinite induction
- Complete partial orders
- Complete lattices
- Knaster-Tarski's fixed point theorem
- Kleene's fixed point theorem
Finite automata on infinite strings
Lecture notes and articles
The course is given in an intensive format ("crash course") at a conference facility.
Page responsible: Director of Graduate Studies
Last updated: 2012-05-03