BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

SETS, LOGIC AND MATHS FOR COMPUTING, 3ED.

SETS, LOGIC AND MATHS FOR COMPUTING, 3ED.

SETS, LOGIC AND MATHS FOR COMPUTING, 3ED.
Stock photo: cover may vary

SETS, LOGIC AND MATHS FOR COMPUTING, 3ED. Paperback - 2020

by David Makinson

Add to wish list
  • New
New

Description

New/New. Brand New Original US Edition, Perfect Condition. Printed in English. Excellent Quality, Service and customer satisfaction guaranteed!
Ask the seller a question Add to wish list
A$89.36
A$22.04 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Students Textbooks (India)

Details

  • Title SETS, LOGIC AND MATHS FOR COMPUTING, 3ED.
  • Author David Makinson
  • Binding Paperback
  • Condition New
  • Pages 398
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2020-05-20
  • Illustrated Yes
  • Features Illustrated
  • Bookseller's Inventory # BIBNNA-11930
  • ISBN 9783030422172 / 3030422178
  • Weight 1.28 lbs (0.58 kg)
  • Dimensions 9.21 x 6.14 x 0.85 in (23.39 x 15.60 x 2.16 cm)
  • Category Computers - General Information
  • Quantity available 1

About Students Textbooks India

Biblio member since 2009

Selling textbooks, International editions and reference books online from last 5 Years.

Terms of Sale:

30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged. Return address: Students_Textbooks 12 phankha road Jankpuri New Delhi 110036 India

Browse books from Students Textbooks

Reader reviews for SETS, LOGIC AND MATHS FOR COMPUTING, 3ED.

From the publisher

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.

From the rear cover

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.

Dr. David Makinson has taught courses related to the material of this book at the American University of Beirut, King's College London and, in recent years, the London School of Economics, UK.

About the author

Dr. David Makinson has taught courses related to the material of this book at the American University of Beirut, King's College London and, in recent years, the London School of Economics, UK.

tracking-