Sets, Logic and Maths for Computing / Edition 2by David Makinson
Pub. Date: 02/28/2012
Publisher: Springer London
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
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 acquiredUses an intuitive approach with a focus on examples for all general conceptsBrings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and inductionBalances carefully the abstract and concrete, principles and proofs, specific facts and general perspectivesIncludes highlight boxes that raise common queries and clear away confusionsProvides numerous exercises, with selected solutions, to test and deepen the reader’s understandingThis 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.
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
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >