TDDB90 Discrete Mathematics and Logic, Introductory Course, 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:
Grimaldi, R. Discrete and Combinatorial Mathematics. Addison-Wesley, 1994. (3ed) Hansen, K. Grundläggande Logik. Studentlitteratur, 1994. (2ed)

TEN 1Written examination
TEN 2Written examination
Course language is Swedish.