Includes bibliographical references (p. 626-629) and index.

Logic. Mathematical Proof. Sets. Relations. Functions. Matrix Algebra. Systems of Linear Equations. Algebraic Structures. Boolean Algebra. Graph Theory. Applications of Graph Theory. References and Further Reading. Hints and Solutions to Selected Exercises. Index

Updated and expanded, Discrete Mathematics for New Technology, Second Edition provides a sympathetic and accessible introduction to discrete mathematics, including the core mathematics requirements for undergraduate computer science students. The approach is comprehensive yet maintains an easy-to-follow progression from the basic mathematical ideas to the more sophisticated concepts examined in the latter stages of the book. Although the theory is presented rigorously, it is illustrated by the frequent use of pertinent examples and is further reinforced with exercises - some with hints and solutions - to enable the reader to achieve a comprehensive understanding of the subject at hand.New to the second edition: numerous new examples and exercises designed to illustrate and reinforce mathematical concepts and facilitate students' progression through the topics; and, new sections on typed set theory and an introduction to formal specification. Presenting material that is at the foundations of mathematics itself, Discrete Mathematics for New Technology is a readable, friendly textbook designed for non-mathematicians as well as for computing and mathematics undergraduates alike.