CDN$ 49.64
  • List Price: CDN$ 129.61
  • You Save: CDN$ 79.97 (62%)
Only 1 left in stock (more on the way).
Ships from and sold by Gift-wrap available.
Discrete Mathematics: Pro... has been added to your Cart
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 3 images

Discrete Mathematics: Proofs, Structures and Applications, Third Edition Hardcover – Nov 9 2009

See all 3 formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
"Please retry"
"Please retry"
CDN$ 49.64
CDN$ 27.43 CDN$ 36.10
"Please retry"
CDN$ 55.97

Harry Potter and the Cursed Child
click to open popover

No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Product Details

  • Hardcover: 843 pages
  • Publisher: CRC Press; 3 edition (Nov. 9 2009)
  • Language: English
  • ISBN-10: 1439812802
  • ISBN-13: 978-1439812808
  • Product Dimensions: 15.7 x 4.3 x 23.6 cm
  • Shipping Weight: 1.3 Kg
  • Average Customer Review: Be the first to review this item
  • Amazon Bestsellers Rank: #918,752 in Books (See Top 100 in Books)
  •  Would you like to update product info, give feedback on images, or tell us about a lower price?

  • See Complete Table of Contents

Product Description


The authors’ diligent attempt to present, analyse and thoroughly demonstrate the subject of DMths is noteworthy. In keeping with the textbook character of their book, they also cite many examples. The book is an integrated textbook of DMths, adequate for undergraduate computer scientists, featuring a synoptic and vital presentation of this important, useful and interesting field. Of course, it is also interesting and useful for students of mathematics, as well as for those who work with informatics in general. It is a classic textbook, well structured and sufficiently complete within the framework established by similar textbooks. The work does a good job keeping a balance between conciseness and in-depth examinations … .
Contemporary Physics, Vol. 52, No. 2, March-April 2011

This is a textbook on discrete mathematics for undergraduate students in computer science and mathematics. The choice of the topics covered in this text is largely suggested by the needs of computer science. It contains chapters on set theory, logic, algebra (matrix algebra and Boolean algebra), and graph theory with applications. … The style of exposition is very clear, step by step and the level is well adapted to undergraduates in computer science. The treatment is mathematically rigorous; therefore it is also suitable for mathematics students. Besides the theory there are many concrete examples and exercises (with solutions!) to develop the routine of the student. So I can recommend warmly this book as a textbook for a course. It looks very attractive and has a nice typography. … Although I haven’t used this book in class (up to now), I think it is an excellent textbook.
―H.G.J. Pijls, University of Amsterdam, The Netherlands

Praise for Previous Editions
Garnier and Taylor offer a work on discrete mathematics sufficiently comprehensive to be used as a resource work in a variety of courses … Now in its second edition, it would also make an excellent general reference book on these areas … a fine undergraduate book.
―R.L. Pour, Emory & Henry College, CHOICE

Provides an accessible introduction to discrete mathematics, including the core mathematics requirements for undergraduate computer science students.
SciTech Book News, Vol. 122

This is the second edition of this accessible yet rigorous introduction to discrete mathematics. As in the first edition, the theory is illustrated by a large number of solved exercises. In this edition further exercises have been added, in particular, at the routine level. In addition, some new material on typed set theory is included.
―S. Teschl

The book is designed for students of computer science. It contains main mathematical topics needed in their undergraduate study. In the second edition, the authors added a lot of new exercises and examples, illustrating discussed concepts. The book contains a lot of well-ordered and nicely illustrated material.
―Vladimir Soucek, European Mathematical Society Newsletter, June 2004

About the Author

Rowan Garnier was a professor of mathematics at Richmond, the American International University in London, where she served ten years as Chair of the Division of Mathematics, Science and Computer Science.

John Taylor is Head of the School of Computing, Mathematical and Information Sciences at the University of Brighton, UK. He has published widely on the applications of diagrammatic logic systems to computer science.

Customer Reviews

There are no customer reviews yet on
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on (beta) HASH(0xa2cd7054) out of 5 stars 2 reviews
2 of 2 people found the following review helpful
By Tyler M - Published on
Format: Kindle Edition Verified Purchase
This book is alright. It was required for my Discrete Mathmetics college course and it contains mostly problems and the rules/properties for solving problems. My biggest complaint is that it doesn't explain how to solve the problems. If your professor doesn't explain it well enough, you'll need to go somewhere else to find out how to solve the problems.
HASH(0xa2c9d870) out of 5 stars The best discrete math book i have ever read Aug. 29 2015
By AlejandroGP - Published on
Format: Hardcover Verified Purchase
The best discrete math book i have ever read. It is a realistic introduction to pure mathematics and its beauty and the difficulty goes increasing in an approachable level.