Anderson (University of South Carolina) emphasizes the development of proofs in this textbook for a two-term course in discrete mathematics. The first eight chapters can be used for a first-level course that covers logic, set theory, algorithms, trees, and number theory. The remaining 14 chapters include groups, lattices, combinatorics, finite differences, graph theory, and networks.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

This carefully organized, very readable book covers every essential topic in discrete mathematics in a logical fashion. Placing each topic in context, it covers concepts associated with discrete mathematical systems that have applications in computer science, engineering, and mathematics. The author introduces more basic concepts at the freshman level than are found in other books, in a simple, accessible form. Introductory material is balanced with extensive coverage of graphs, trees, recursion, algebra, theory of computing, and combinatorics. Extensive examples throughout the text reinforce concepts. More combinatorics/algebraic structures than in most books. Detailed discussion of and strong emphasis on proofs. Extensive, in-depth presentation of topics. Large selection of applied and computational problems, ranging from the elementary to the more advanced. More topics in probability and more statistical interpretations than other texts. Comprehensive discussion of topics such as finite state machines, automata, and languages. Earlier introduction of matrices and relations, Boolean algebras and circuits than most texts. Includes algorithms for many constructive tasks that occur in discrete systems.