Sets, Logic and Maths for Computing (Undergraduate Topics in Computer Science)

Makinson, David

ISBN 10: 1447124995 / ISBN 13: 9781447124993

Published by Springer, 2012

About this Item

Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 001342705U

Bibliographic Details

Title: Sets, Logic and Maths for Computing (...

Publisher: Springer

Publication Date: 2012

Binding: paperback

Condition: Good

Edition: 2nd ed. 2012.

About this title

Synopsis:

This easy-to-follow book introduces the mathematical language, knowledge and problem-solving skills needed for the study of computing. The language is both qualitative and quantitative, and includes basic notions of logic used for representation and proof.

From the Back Cover:

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.