國立高雄大學圖資館 |

Language: English

Back

Sets, logic and maths for computing

Makinson, David.

Sets, logic and maths for computing

Record Type:	Electronic resources : Monograph/item
Title/Author:	Sets, logic and maths for computingby David Makinson.
Author:	Makinson, David.
Published:	Cham :Springer International Publishing :2020.
Description:	xviii, 398 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Computer scienceMathematics.
Online resource:	https://doi.org/10.1007/978-3-030-42218-9
ISBN:	9783030422189$q(electronic bk.)

Sets, logic and maths for computing
Makinson, David.

Sets, logic and maths for computing[electronic resource] /by David Makinson. - Third edition. - Cham :Springer International Publishing :2020. - xviii, 398 p. :ill., digital ;24 cm. - Undergraduate topics in computer science,1863-7310. - Undergraduate topics in computer science..

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.

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.

ISBN: 9783030422189$q(electronic bk.)

Standard No.: 10.1007/978-3-030-42218-9doiSubjects--Topical Terms:

181991
Computer science
--Mathematics.

LC Class. No.: QA76.9.M35 / M355 2020

Dewey Class. No.: 004.0151

Sets, logic and maths for computing
LDR:03536nmm a2200361 a 4500 001 579489
003 DE-He213
005 20200519105435.0
006 m
007 cr
008 201229s2020
020 $a 9783030422189$q(electronic bk.)
020 $a 9783030422172$q(paper)
024 7 $a 10.1007/978-3-030-42218-9 $2 doi
035 $a 978-3-030-42218-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35 $b M355 2020
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b M235 2020
100 1 $a Makinson, David. $3 338132
245 1 0 $a Sets, logic and maths for computing $h [electronic resource] / $c by David Makinson.
250 $a Third edition.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xviii, 398 p. : $b ill., digital ; $c 24 cm.
490 1 $a Undergraduate topics in computer science, $x 1863-7310
505 0 $a 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.
520 $a 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.
650 0 $a Computer science $x Mathematics. $3 181991
650 1 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Computational Science and Engineering. $3 274685
650 2 4 $a Discrete Mathematics. $3 524738
650 2 4 $a Mathematical Logic and Foundations. $3 274479
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Undergraduate topics in computer science. $3 559648
856 4 0 $u https://doi.org/10.1007/978-3-030-42218-9
950 $a Computer Science (Springer-11645)