Description

Book Synopsis

This easy-to-understand textbook introduces the mathematical language and problem-solving tools essential to anyone wishing to enter the world of computer and information sciences. Specifically designed for the student who is intimidated by mathematics, the book offers a concise treatment in an engaging style.

The thoroughly revised third edition features a new chapter on relevance-sensitivity in logical reasoning and many additional explanations on points that students find puzzling, including the rationale for various shorthand ways of speaking and ‘abuses of language’ that are convenient but can give rise to misunderstandings. Solutions are now also provided for all exercises.

Topics and features: presents an intuitive approach, emphasizing how finite mathematics supplies a valuable language for thinking about computation; discusses sets and the mathematical objects built with them, such as relations and functions, as well as recursion and induction; introduces core topics of mathematics, including combinatorics and finite probability, along with the structures known as trees; examines propositional and quantificational logic, how to build complex proofs from simple ones, and how to ensure relevance in logic; addresses questions that students find puzzling but may have difficulty articulating, through entertaining conversations between Alice and the Mad Hatter; provides an extensive set of solved exercises throughout the text.

This clearly-written textbook offers invaluable guidance to students beginning an undergraduate degree in computer science. The coverage is also suitable for courses on formal methods offered to those studying mathematics, philosophy, linguistics, economics, and political science. Assuming only minimal mathematical background, it is ideal for both the classroom and independent study.



Table of Contents

Part I: Sets

Collecting Things Together: Sets

Comparing Things: Relations

Associating One Item with Another: Functions

Recycling Outputs as Inputs: Induction and Recursion

Part II: Math

Counting Things: Combinatorics

Weighing the Odds: Probability

Squirrel Math: Trees

Part III: Logic

Yea and Nay: Propositional Logic

Something about Everything: Quantificational Logic

Just Supposing: Proof and Consequence

Sticking to the Point: Relevance in Logic

Sets, Logic and Maths for Computing

    Product form

    £22.99

    Includes FREE delivery

    Order before 4pm today for delivery by Mon 15 Jun 2026.

    A Paperback / softback by David Makinson

    15 in stock


      View other formats and editions of Sets, Logic and Maths for Computing by David Makinson

      Publisher: Springer Nature Switzerland AG
      Publication Date: 20/05/2020
      ISBN13: 9783030422172, 978-3030422172
      ISBN10: 3030422178

      Description

      Book Synopsis

      This easy-to-understand textbook introduces the mathematical language and problem-solving tools essential to anyone wishing to enter the world of computer and information sciences. Specifically designed for the student who is intimidated by mathematics, the book offers a concise treatment in an engaging style.

      The thoroughly revised third edition features a new chapter on relevance-sensitivity in logical reasoning and many additional explanations on points that students find puzzling, including the rationale for various shorthand ways of speaking and ‘abuses of language’ that are convenient but can give rise to misunderstandings. Solutions are now also provided for all exercises.

      Topics and features: presents an intuitive approach, emphasizing how finite mathematics supplies a valuable language for thinking about computation; discusses sets and the mathematical objects built with them, such as relations and functions, as well as recursion and induction; introduces core topics of mathematics, including combinatorics and finite probability, along with the structures known as trees; examines propositional and quantificational logic, how to build complex proofs from simple ones, and how to ensure relevance in logic; addresses questions that students find puzzling but may have difficulty articulating, through entertaining conversations between Alice and the Mad Hatter; provides an extensive set of solved exercises throughout the text.

      This clearly-written textbook offers invaluable guidance to students beginning an undergraduate degree in computer science. The coverage is also suitable for courses on formal methods offered to those studying mathematics, philosophy, linguistics, economics, and political science. Assuming only minimal mathematical background, it is ideal for both the classroom and independent study.



      Table of Contents

      Part I: Sets

      Collecting Things Together: Sets

      Comparing Things: Relations

      Associating One Item with Another: Functions

      Recycling Outputs as Inputs: Induction and Recursion

      Part II: Math

      Counting Things: Combinatorics

      Weighing the Odds: Probability

      Squirrel Math: Trees

      Part III: Logic

      Yea and Nay: Propositional Logic

      Something about Everything: Quantificational Logic

      Just Supposing: Proof and Consequence

      Sticking to the Point: Relevance in Logic

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account