Discrete Mathematics for Computer Scientists

Front Cover
Addison-Wesley, 1999 - Mathematics - 585 pages
1 Review
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 practical 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 machines & 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


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 »

About the author (1999)

John Truss has taught at Oxford University, Paisley College of Technology and currently at the University of Leeds. He has been a committee member of the British Logic Colloquium since 1990, and has recently been appointed an editor of the Journal of the London Mathematical Society. He wrote Foundations of Mathematical Analysis in 1997 and has authored 40 research papers.


Bibliographic information