Winfried Karl Grassmann
Jean-Paul Tremblay, both at the University of Saskatchewan

Published December, 1995 by Prentice Hall Engineering/Science/Mathematics

Copyright 1996, 750 pp.
Cloth
ISBN 0-13-501206-6
$77.00

Sign up for future
mailings on this subject.

See other books about:
    Theory Of Computation

This book covers all the traditional topics of discrete mathematics—logic, sets, relations, functions, and graphs—and reflects recent trends in computer science.

Shows how to use discrete mathematics and logic for specifying new computer applications, and how to reason about programs in a systematic way. Describes Prolog, a programming language based on logic, and a section on Miranda, language bad on functions. Features numerous examples which relate the mathematical concepts to problems in computer science.

1. Propositional Calculus.
2. Predicate Calculus.
3. Induction and Recursion.
4. Prolog.
5. Sets and Relations.
6. More About Functions.
7. Graphs And Trees
8. Formal Requirement Specification in Z.
9. Program Correctness Proofs.
10. Grammars, Languages, and Parsing.
11. Derivations.
12. An Overview of Relational Database Systems.
Bibliography.
Solutions to Even-numbered Problems.
Index.