Discrete Mathematics for Computer Scientists

Front Cover
Addison-Wesley, 1999 - Mathematics - 585 pages
1 Review
The second edition of 'Discrete Mathematics for Computer Scientists' provides an accessible introduction to the subject for beginners and an unparalleled reference source for the more experienced programmer. It includes a thorough coverage of all areas of discrete mathematics, including logic, natural numbers, coding theory, combinatorics, sets, algebraic functions, partially ordered structures, graphs, formal machines and complexity theory, as well as a special emphasis on the central role of propositional and predicate logic. This edition incorporates an improved treatment of induction and coverage of more 'basic' algebra, while the style has been made more accessible. Chapter 6 has been replaced by two chapters on propositional logic and further logic.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


The natural numbers
Introductory logic
Sets relations and functions

18 other sections not shown

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information