Discrete Structures II (CUGS core)2023HT
|
|
Course plan
Lectures
9h
Recommended for
CUGS, ECSEL, PhD students in computer science
The course was last given
Autumn 2022
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
Organized by
Literature
Lecture notes
Lecturers
Victor Lagerkvist
Examiner
Victor Lagerkvist
Examination
Homework assignments
Credit
6 hp
Comments
Page responsible: Anne Moe