Apress

Mathematics of Discrete Structures for Computer Science

By Gordon J. Pace

Mathematics of Discrete Structures for Computer Science Cover Image

Approaching mathematics from a computer science viewpoint, this book defines ways of calculating the results of applying the operators, then shows how they satisfy various properties. The comprehensive text is supplemented with summaries, proofs and exercises.

Full Description

  • ISBN13: 978-3-6422-9839-4
  • 309 Pages
  • User Level: Students
  • Publication Date: September 13, 2012
  • Available eBook Formats: PDF
  • eBook Price: $59.95
Buy eBook Buy Print Book Add to Wishlist
Full Description
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
Table of Contents

Table of Contents

  1. Why Mathematics?.
  2. Propositional Logic.
  3. Predicate Calculus.
  4. Sets.
  5. Relations.
  6. Classifying Relations.
  7. More Discrete Structures.
  8. Defining New Structured Types.
  9. Numbers.
  10. Reasoning About Programs.
  11. Index.
Errata

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published