Alan Doerr

This textbook was written for a first course in digital logic for computer science majors. The book covers set theory, combinatorics, logic, matrix algebra, relations, functions, recursion, graph theory, trees, Boolean algebra, monoids, automata, group theory, rings, fields, and determinants.

While writing this book, the authors took into account the national guidelines for teaching discrete mathematics.

The Pascal programming examples scattered throughout the book can be omitted with impunity.

Exercises and problem sets are included in each chapter at three levels of difficulty. Some of the problems can be done by all students. Then there are computations and theoretical problems that are difficult, but not impossible, for average students. Finally there are problems that will challenge even the best of students.… (meer)