This book, "Introduction to Discrete Mathematics", is primarily aimed at students of Computer Science departments, as well as other departments where Computer Science is taught, and anyone interested in the subject of Discrete Mathematics.
The book is the result of my teaching at the Department of Computer Science of the TEI of Thessaloniki, from its establishment (1987) until 2011.

The goals of the book are:
1. To broaden the mathematical maturity of students during the study of a scientific area that is quite different from the traditional coverage in basic Calculus.
2. To study methods and techniques for students to be able to solve problems that arise in various fields in computer science.
3. To develop students' abilities to create and solve such problems, interpret their solutions, and apply them.

The book consists of eight chapters, which cover the basic topics of teaching Discrete Mathematics over a semester. These are:
- basic topics of Logic Algebra,
- introduction to Set Theory and Boolean Algebra with reference to logic circuits and switch circuits,
- topics from Number Theory,
- basic Enumeration rules with an introduction to Combinatorial Analysis,
- Discrete Arithmetic Functions and Function Generators,
- Recursive Relations,
- broad introduction to Graph Theory,
- elements of Trees with a description of basic algorithms such as Dijkstra, Kruskal, etc.

Each chapter contains several solved examples. Additionally, each chapter is accompanied by a sufficient number of unsolved exercises. In total, there are approximately 350 solved examples and 220 unsolved exercises.

It should be noted that each scientific term is accompanied by the corresponding English expression, so that the reader has easier access to international literature.