PREFACE Discrete mathematics,the study of finite systems,has become increasingly important as the computer age has advanced.The digital computer is basically a finite structure,and many of its properties can be understood and interpreted within the framework of finite mathematical systems.This book,in presenting the more essential material,may be used as a textbook for a formal course in discrete mathematics or as a supplement to all current texts. The first three chapters cover the standard material on sets,relations,and functions and algorithms.Next come chapters on logic,counting,and probability.We then have three chapters on graph theory:graphs,directed graphs,and binary trees.Finally there are individual chapters on properties of the integers,languages,machines, ordered sets and lattices,and Boolean algebra,and appendices on vectors and matrices,and algebraic systems. The chapter on functions and algorithms includes a discussion of cardinality and countable sets,and complexity. The chapters on graph theory include discussions on planarity,traversability,minimal paths,and Warshall's and Huffman's algorithms.We emphasize that the chapters have been written so that the order can be changed without difficulty and without loss of continuity. Each chapter begins with a clear statement of pertinent definitions,principles,and theorems with illustrative and other descriptive material.This is followed by sets of solved and supplementary problems.The solved problems serve to illustrate and amplify the material,and also include proofs of theorems.The supplementary problems furnish a complete review of the material in the chapter.More material has been included than can be covered in most first courses.This has been done to make the book more flexible,to provide a more useful book of reference,and to stimulate further interest in the topics. SEYMOUR LIPSCHUTZ MARC LARS LIPSON Copyright2007,1997,1976 by The McGraw-Hill Companies,Inc.Click here for terms of use.PREFACE Discrete mathematics, the study of finite systems, has become increasingly important as the computer age has advanced. The digital computer is basically a finite structure, and many of its properties can be understood and interpreted within the framework of finite mathematical systems. This book, in presenting the more essential material, may be used as a textbook for a formal course in discrete mathematics or as a supplement to all current texts. The first three chapters cover the standard material on sets, relations, and functions and algorithms. Next come chapters on logic, counting, and probability. We then have three chapters on graph theory: graphs, directed graphs, and binary trees. Finally there are individual chapters on properties of the integers, languages, machines, ordered sets and lattices, and Boolean algebra, and appendices on vectors and matrices, and algebraic systems. The chapter on functions and algorithms includes a discussion of cardinality and countable sets, and complexity. The chapters on graph theory include discussions on planarity, traversability, minimal paths, and Warshall’s and Huffman’s algorithms. We emphasize that the chapters have been written so that the order can be changed without difficulty and without loss of continuity. Each chapter begins with a clear statement of pertinent definitions, principles, and theorems with illustrative and other descriptive material. This is followed by sets of solved and supplementary problems. The solved problems serve to illustrate and amplify the material, and also include proofs of theorems. The supplementary problems furnish a complete review of the material in the chapter. More material has been included than can be covered in most first courses. This has been done to make the book more flexible, to provide a more useful book of reference, and to stimulate further interest in the topics. Seymour Lipschutz Marc Lars Lipson v Copyright © 2007, 1997, 1976 by The McGraw-Hill Companies, Inc. Click here for terms of use