# Sets, Logic and Maths for Computing

Textbook

Part of the Undergraduate Topics in Computer Science book series (UTICS)

1. Front Matter
Pages i-xxi
2. David Makinson
Pages 1-25
3. David Makinson
Pages 27-56
4. David Makinson
Pages 57-78
5. David Makinson
Pages 79-111
6. David Makinson
Pages 113-136
7. David Makinson
Pages 137-164
8. David Makinson
Pages 165-188
9. David Makinson
Pages 189-215
10. David Makinson
Pages 217-241
11. David Makinson
Pages 243-274
12. Back Matter
Pages 275-283

### Introduction

This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduate students need to enter the world of computer and information sciences. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. In ten chapters on these topics, the book guides the student through essential concepts and techniques.

The extensively revised second edition provides further clarification of matters that typically give rise to difficulty in the classroom and restructures the chapters on logic to emphasize the role of consequence relations and higher-level rules, as well as including more exercises and solutions.

Topics and features:

• Teaches finite mathematics as a language for thinking, as much as knowledge and skills to be acquired
• Uses an intuitive approach with a focus on examples for all general concepts
• Brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction
• Balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives
• Includes highlight boxes that raise common queries and clear away confusions
• Provides numerous exercises, with selected solutions, to test and deepen the reader’s understanding

This clearly-written text/reference is a must-read for first-year undergraduate students of computing. Assuming only minimal mathematical background, it is ideal for both the classroom and independent study.

Dr. David Makinson is a Visiting Professor in the Department of Philosophy, Logic and Scientific Method at the London School of Economics, UK.

### Keywords

Computer Science Computing Discrete Mathematics Information Science Logic

#### Authors and affiliations

1. 1.Department of PhilosophyLondon School of EconomicsLondonUnited Kingdom

Dr. David Makinson is a Visiting Professor in the Department of Philosophy, Logic and Scientific Method at the London School of Economics, UK.

### Bibliographic information

• Book Title Sets, Logic and Maths for Computing
• Authors David Makinson
• Series Title Undergraduate Topics in Computer Science
• DOI https://doi.org/10.1007/978-1-4471-2500-6
• Copyright Information Springer-Verlag London Limited 2012
• Publisher Name Springer, London
• eBook Packages Computer Science Computer Science (R0)
• Softcover ISBN 978-1-4471-2499-3
• eBook ISBN 978-1-4471-2500-6
• Series ISSN 1863-7310
• Edition Number 2
• Number of Pages XXI, 283
• Number of Illustrations 17 b/w illustrations, 0 illustrations in colour
• Topics
• Buy this book on publisher's site
Industry Sectors
IT & Software

## Reviews

From the reviews of the second edition:

“This book is an excellent introductory course on mathematical language, knowledge and problem solving skills for undergraduate students who need to enter the world of computer and information sciences. … This easy-to-follow text allows readers to carry out their computing studies with a clear understanding of the basic finite mathematics and mathematical logics that they will need. … is ideal for self-study as well as classroom use. … the book will be of interest to any student who would like to understand the mathematical language.” (Valentina Dagienë, Zentralblatt MATH, Vol. 1239, 2012)