Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Discrete Mathematics Using a Computer

Discrete Mathematics Using a Computer

O'Donnell, John, Hall, Cordelia, Page, Rex

2nd ed. 2006, XIX, 441 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-1-84628-598-1

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-1-84628-241-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

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: http://www.dcs.gla.ac.uk/~jtod/discrete-mathematics/

Content Level » Lower undergraduate

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

Related subjects » Theoretical Computer Science

Table of contents 

Programming and Reasoning with Equations.- to Haskell.- Equational Reasoning.- Recursion.- Trees.- Logic.- Propositional Logic.- Predicate Logic.- Set Theory.- Set Theory.- Inductively Defined Sets.- Relations.- Functions.- Applications.- The AVL Tree Miracle.- Discrete Mathematics in Circuit Design.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Discrete Mathematics in Computer Science.

Additional information