Discrete Mathematics Using a Computer

  • John O’Donnell
  • Cordelia Hall
  • Rex Page

Table of contents

  1. Front Matter
    Pages i-xix
  2. Programming and Reasoning with Equations

    1. Front Matter
      Pages 1-1
    2. Pages 37-46
    3. Pages 47-60
    4. Pages 61-81
    5. Pages 83-106
  3. Logic

    1. Front Matter
      Pages 107-107
    2. Pages 109-162
    3. Pages 163-185
  4. Set Theory

    1. Front Matter
      Pages 187-187
    2. Pages 189-206
    3. Pages 207-222
    4. Pages 223-265
    5. Pages 267-309
  5. Applications

    1. Front Matter
      Pages 311-311
    2. Pages 313-353
  6. Back Matter
    Pages 377-441

About this book


Discrete Mathematics Using a Computer offers a new, "hands-on" approach to teaching Discrete Mathematics. Using software that is freely available on Mac, PC and Unix platforms, the functional language Haskell allows students to experiment with mathematical notations and concepts -- a practical approach that provides students with instant feedback and allows lecturers to monitor progress easily.

This second edition of the successful textbook contains significant additional material on the applications of formal methods to practical programming problems. There are more examples of induction proofs on small programs, as well as a new chapter showing how a mathematical approach can be used to motivate AVL trees, an important and complex data structure.

Designed for 1st and 2nd year undergraduate students, the book is also well suited for self-study. No prior knowledge of functional programming is required; everything the student needs is either provided or can be picked up easily as they go along.

Key features include:

• Numerous exercises and examples

• A web page with software tools and additional practice problems, solutions, and explanations, as well as course slides

• Suggestions for further reading

Complete with an accompanying instructor's guide, available via the web, this volume is intended as the primary teaching text for Discrete Mathematics courses, but will also provide useful reading for Conversion Masters and Formal Methods courses.

Visit the book’s Web page at:


Computer Correctness proofs Discrete Mathematics Formal Methods Functional Programming Induction Mathematical Logic Mechanized logic Recursion Sets, relations, functions data structure formal method logic programming

Authors and affiliations

  • John O’Donnell
    • 1
  • Cordelia Hall
    • 1
  • Rex Page
    • 2
  1. 1.Computing Science DepartmentUniversity of GlasgowGlasgowUK
  2. 2.School of Computer ScienceUniversity of OklahomaNormanUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag London Limited 2006
  • Publisher Name Springer, London
  • eBook Packages Computer Science
  • Print ISBN 978-1-84628-241-6
  • Online ISBN 978-1-84628-598-1
  • Buy this book on publisher's site
Industry Sectors
IT & Software