TDDB94 Discrete Mathematics and Logic, Introductory Course, 13,5 ECTS-points
/Diskret matematik och logik/

Advancement level:
B

Aim:
To provide the basic foundations of discrete mathematics and logic with emphasis on computer science applications.

Prerequisites:
None

Course organization:
Lectures presenting theory and problem solving sessions to practice and illustrate the theory.

Course content:
Discrete mathematics: Basic set-theory. Relations and functions. The integers. Induction and recursion. Algorithms. The Euclidian algorithm. Complexity theory and analysis of algorithms. Boolean algebra. Graphs and trees. Finite automata. Logic: Valid arguments. Premises and conclusions. Propositional- and predicate logic. Syntax and semantics. Model and proof theory. Derivation rules. Natural deduction. Resolution. Soundness and completeness.

Course literature:
Björn, A, Turesson, B O: Diskret matematik, 1998. Hansen, K. Grundläggande Logik. Studentlitteratur, 1994.

TEN1Written examination, 4 p.
TEN2Written examination, 4 p.
Course language is swedish.