Discrete Structures II FDA141, 2004VT Status Archive School National Graduate School in Computer Science (CUGS) Division SAS Owner Ulf Nilsson Homepage http://www.ida.liu.se/~ulfni/ds2/

Log in

---

Course plan

Lectures

16h

Recommended for

CUGS, ECSEL, PhD students in computer science

The course was last given

Spring 2003

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

Organized by

Literature

Lecture notes and articles

Lecturers

Ulf Nilsson

Examiner

Ulf Nilsson

Examination

Homework assignments

Credit

2.5 credits

Comments

The course is given in an intensive format ("crash course") at a conference facility.

Page responsible: Anne Moe