Discrete Structures II
Linköping University
Goals
Provide a deepened understanding of core concepts vital for
computer science and which are typically not covered by
introductory courses in discrete mathematics.
Prerequisites
Introductory courses in discrete mathematics and formal languages and automata theory.
Contents
Well-founded sets and ordinals
Inductive definitions and proofs,
- Well-founded induction
- Transfinite induction
Lattice theory
- Complete partial orders
- Lattices
- Complete lattices
Fixed points
- Monotonicity
- Knaster-Tarski's fixed point theorem
- Continuity
- Kleene's fixed point theorem
Finite automata on infinite strings
Back
|