This edition offers a pedagogically rich and intuitive introduction to discrete mathematics structures. It meets the needs of computer science majors by being both comprehensive and accessible.

Judith Gerstings Mathematical Structures for Computer Science has long been acclaimed for its clear presentation of essential concepts and its exceptional range of applications relevant to computer science majors. Now with this new edition, it is the first discrete mathematics textbook revised to meet the proposed new ACM/IEEE standards for the course.

Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science. The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs. The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.

This text has been designed as a complete introduction to discrete mathematics, primarily for computer science majors in either a one or two semester course. The topics addressed are of genuine use in computer science, and are presented in a logically coherent fashion. The material has been organized and interrelated to minimize the mass of definitions and the abstraction of some of the theory. For example, relations and directed graphs are treated as two aspects of the same mathematical idea. Whenever possible each new idea uses previously encountered material, and then developed in such a way that it simplifies the more complex ideas that follow.

This book contains fundamental concepts on discrete mathematical structures in an easy to understand style so that the reader can grasp the contents and explanation easily. The concepts of discrete mathematical structures have application to computer science, engineering and information technology including in coding techniques, switching circuits, pointers and linked allocation, error corrections, as well as in data networking, Chemistry, Biology and many other scientific areas. The book is for undergraduate and graduate levels learners and educators associated with various courses and progammes in Mathematics, Computer Science, Engineering and Information Technology. The book should serve as a text and reference guide to many undergraduate and graduate programmes offered by many institutions including colleges and universities. Readers will find solved examples and end of chapter exercises to enhance reader comprehension. Features Offers comprehensive coverage of basic ideas of Logic, Mathematical Induction, Graph Theory, Algebraic Structures and Lattices and Boolean Algebra Provides end of chapter solved examples and practice problems Delivers materials on valid arguments and rules of inference with illustrations Focuses on algebraic structures to enable the reader to work with discrete structures

Master the fundamentals of discrete mathematics with DISCRETE MATHEMATICS FOR COMPUTER SCIENCE with Student Solutions Manual CD-ROM! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a wealth of exercises and examples, you will learn how mastering discrete mathematics will help you develop important reasoning skills that will continue to be useful throughout your career.

'The presentation is modeled on the discursive style of the Bourbaki collective, and the coverage of topics is rich and varied. Grandis has provided a large selection of exercises and has sprinkled orienting comments throughout. For an undergraduate library where strong students seek an overview of a significant portion of mathematics, this would be an excellent acquisition. Summing up: Recommended.'CHOICESince the last century, a large part of Mathematics is concerned with the study of mathematical structures, from groups to fields and vector spaces, from lattices to Boolean algebras, from metric spaces to topological spaces, from topological groups to Banach spaces.More recently, these structured sets and their transformations have been assembled in higher structures, called categories.We want to give a structural overview of these topics, where the basic facts of the different theories are unified through the 'universal properties' that they satisfy, and their particularities stand out, perhaps even more.This book can be used as a textbook for undergraduate studies and for self-study. It can provide students of Mathematics with a unified perspective of subjects which are often kept apart. It is also addressed to students and researchers of disciplines having strong interactions with Mathematics, like Physics and Chemistry, Statistics, Computer Science, Engineering.

Teaches students the mathematical foundations of computer science, including logic, Boolean algebra, basic graph theory, finite state machines, grammars and algorithms, and helps them understand mathematical reasoning for reading, comprehension and construction of mathematical arguments.