Course Syllabus for

Discrete Structures and Introduction to Proofs
Diskreta strukturer och introduktion till bevis

EDA030F, 6 credits

Valid from: Spring 2016
Decided by: Professor Thomas Johansson
Date of establishment: 2016-10-27

General Information

Division: Computer Science (LTH)
Course type: Third-cycle course
Teaching language: English


The aim of the course is to introduce concepts in discrete structures that are central to computer science.


Knowledge and Understanding

For a passing grade the doctoral student must

Competences and Skills

For a passing grade the doctoral student must

Course Contents

Sets, relations, functions, induction, recursion, trees, grafs, propositional logic, predicate logic, interactive proof assistants.

Course Literature

The preface and the chapters on Basics, Induction, and Lists are included in the course.

Instruction Details

Types of instruction: Seminars, laboratory exercises, exercises, miscellaneous. The course is given in the form of exercises, labs, peer marking, and seminarier. Before each seminar, the PhD student shall read course material and do exercises and/or labs. Each PhD student will do peer marking of certain exercises and/or labs. At the seminars, different solutions are discussed.

Examination Details

Examination formats: Written assignments, miscellaneous. Active participation at seminars. The assignments include both solutions to exercises and feedback on other solutions.
Grading scale: Failed, pass

Admission Details

Further Information

In addition to the course book, certain material from the internet is included (videos and lecture notes).

Course Occasion Information

Contact and Other Information

Course coordinators:
Web page:

Complete view