Skip to main content
  • Textbook
  • © 2012

Sets, Logic and Maths for Computing

Authors:

  • 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
  • Includes supplementary material: sn.pub/extras

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

Buy it now

Buying options

eBook USD 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (10 chapters)

  1. Front Matter

    Pages i-xxi
  2. Collecting Things Together: Sets

    • David Makinson
    Pages 1-25
  3. Comparing Things: Relations

    • David Makinson
    Pages 27-56
  4. Counting Things: Combinatorics

    • David Makinson
    Pages 113-136
  5. Weighing the Odds: Probability

    • David Makinson
    Pages 137-164
  6. Squirrel Math: Trees

    • David Makinson
    Pages 165-188
  7. Yea and Nay: Propositional Logic

    • David Makinson
    Pages 189-215
  8. Just Supposing: Proof and Consequence

    • David Makinson
    Pages 243-274
  9. Back Matter

    Pages 275-283

About this book

This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. 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. 

Features: teaches finite math 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 confusions; provides numerous exercises, with selected solutions.

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)

Authors and Affiliations

  • Department of Philosophy, London School of Economics, London, United Kingdom

    David Makinson

About the author

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

Buy it now

Buying options

eBook USD 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access