Written for the prospective computer scientist, computer engineer, or applied mathematician, Discrete Structures, Logic, and Computability, Third Edition provides elementary introductions to those ideas and techniques that are necessary to understand and practice the art and science of computing. The text contains all the topics for discrete structures highlighted in the reports put forth by the IEEE/ACM Joint Task Force on Computing Curricula for both computer science and computer engineering programs. The author supports a spiral method of learning by introducing the basics of a given topic and then revisiting the topic whenever new skills or knowledge about the topic are needed to solve problems. This approach allows students to master key material and maximizes their problem-solving ability. Key features of the Third Edition • Over 100 new examples and exercises have been added. • Expanded and revised coverage of discrete probability, including finite Markov chains with applications to software development. • Expanded and revised coverage of techniques for working with summations, including an introduction to approximation methods and harmonic numbers with applications to analyzing algorithms. • Revised presentation of formal reasoning introduces a set of proof rules for “Natural Deduction” so that formal proofs closely model the natural way that we reason informally. • Several discussions throughout the text have been reworked to clarify topics and allow students to focus more sharply on key material. • An online instructor’s Solutions Manual is available.