Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Sets, Logic and Maths for Computing

Sets, Logic and Maths for Computing

Makinson, David

2nd ed. 2012, XXI, 283p. 17 illus..

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-1-4471-2500-6

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-1-4471-2499-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • Only minimal background in mathematics necessary
  • Careful selection of material that is really needed by students in the first two years of their university life in Computer Science and Information Sciences
  • Brings out the interplay between qualitative thinking and calculation
  • Teaches the material as a language for thinking in, as much as knowledge to be gained

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.

Content Level » Lower undergraduate

Keywords » Computer Science - Computing - Discrete Mathematics - Information Science - Logic

Related subjects » Computational Science & Engineering - Theoretical Computer Science

Table of contents 

Collecting Things Together: Sets

Comparing Things: Relations

Associating One Item with Another: Functions

Recycling Outputs as Inputs: Induction and Recursion

Counting Things: Combinatorics

Weighing the Odds: Probability

Squirrel Math: Trees

Yea and Nay: Propositional Logic

Something about Everything: Quantificational Logic

Just Supposing: Proof and Consequence

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Discrete Mathematics in Computer Science.