Discrete Mathematics for Computer Scientists (2nd Edition)

This is a new edition of a successful introduction to discrete mathematics for computer scientists, updated and reorganised to be more appropriate for the modern day undergraduate audience. Discrete mathematics forms the theoretical basis for computer science and this text combines a rigorous approach to mathematical concepts with strong motivation of these techniques via examples.
Key Features
Thorough coverage of all area of discrete mathematics, including logic, natural numbers, coding theory, combinatorics, sets, algebraic functions, partially ordered structures, graphs, formal & complexity theory
Special emphasis on the central role of propositional & predicate logic
Full chapters on algorithm analysis & complexity theory
Introductory coverage of formal machines & coding theory
Over 700 exercises
Flexible structure so that the material can be easily adapted for different teaching styles.
New to this Edition
Improved treatment of induction
Coverage of more 'basic' algebra
List of symbols including page references for definition/explantion
Modern text design and new exercises to aid student comprehension