國立虎尾科技大學 |

Sets, Logic and Maths for Computing

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Sets, Logic and Maths for Computing/ by David Makinson.
Author:	Makinson, David.
Description:	XVIII, 398 p. 36 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Mathematical Logic and Foundations. -
Online resource:	https://doi.org/10.1007/978-3-030-42218-9
ISBN:	9783030422189

Sets, Logic and Maths for Computing
Makinson, David.

Sets, Logic and Maths for Computing[electronic resource] /by David Makinson. - 3rd ed. 2020. - XVIII, 398 p. 36 illus.online resource. - 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

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

669393
Mathematical Logic and Foundations.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Sets, Logic and Maths for Computing
LDR:03880nam a22004095i 4500 001 1027458
003 DE-He213
005 20200629172523.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030422189 $9 978-3-030-42218-9
024 7 $a 10.1007/978-3-030-42218-9 $2 doi
035 $a 978-3-030-42218-9
050 4 $a QA76.9.M35
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
100 1 $a Makinson, David. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 633616
245 1 0 $a Sets, Logic and Maths for Computing $h [electronic resource] / $c by David Makinson.
250 $a 3rd ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XVIII, 398 p. 36 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 2 4 $a Mathematical Logic and Foundations. $3 669393
650 2 4 $a Discrete Mathematics. $3 796600
650 2 4 $a Computational Science and Engineering. $3 670319
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Computer mathematics. $3 1199796
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Computer science—Mathematics. $3 1253519
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030422172
776 0 8 $i Printed edition: $z 9783030422196
830 0 $a Undergraduate Topics in Computer Science, $x 1863-7310 $3 1254738
856 4 0 $u https://doi.org/10.1007/978-3-030-42218-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)