EDA030F

Temporary

Discrete Structures and Introduction to Proofs

6

Third-cycle course

7121 (Computer Science (LTH))

 -10-27

Professor Thomas Johansson

English

If sufficient demand

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

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

understand basic concepts in discrete structures
understand the structure of proofs

be able to apply concepts in discrete structures on problems in computer science
be able to apply basic techniques to construct proofs

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.

Written assignments

Miscellaneous

Active participation at seminars. The assignments include both solutions to exercises and feedback on other solutions.

Failed, pass

Makinson, D.: Sets, Logic, and Maths for Computing, 2nd edition.. Springer, 2012. ISBN 9781447124993.
Pierce, Benjamin C.: Software Foundations. Electronic textbook. Version 4.0.. 2016.

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

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

EDA030F

 -10-27

Professor Thomas Johansson