Books+ Search Results

Sets, Logic and Maths for Computing

Title
Sets, Logic and Maths for Computing [electronic resource] / by David Makinson.
ISBN
9783030422189
Edition
3rd ed. 2020.
Publication
Cham : Springer International Publishing : Imprint: Springer, 2020.
Physical Description
1 online resource (XVIII, 398 p.) 36 illus.
Local Notes
Access is available to the Yale community.
Access and use
Access restricted by licensing agreement.
Summary
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.
Variant and related titles
Springer ENIN.
Other formats
Printed edition:
Printed edition:
Format
Books / Online
Language
English
Added to Catalog
August 11, 2023
Series
Undergraduate Topics in Computer Science,
Undergraduate Topics in Computer Science,
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.
Also listed under
SpringerLink (Online service)
Citation

Available from:

Online
Loading holdings.
Unable to load. Retry?
Loading holdings...
Unable to load. Retry?