LEADER 04889nam 22007095 450 001 9910409668503321 005 20250811202958.0 010 $a3-030-42218-6 024 7 $a10.1007/978-3-030-42218-9 035 $a(CKB)4100000011254650 035 $a(MiAaPQ)EBC6202752 035 $a(DE-He213)978-3-030-42218-9 035 $a(MiAaPQ)EBC6420165 035 $a(Au-PeEL)EBL6420165 035 $a(OCoLC)1155168617 035 $a(PPN)248395262 035 $a(EXLCZ)994100000011254650 100 $a20200519d2020 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSets, Logic and Maths for Computing /$fby David Makinson 205 $a3rd ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (408 pages) 225 1 $aUndergraduate Topics in Computer Science,$x2197-1781 300 $aIncludes index. 311 08$a3-030-42217-8 327 $aPart 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. 330 $aThis 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. 410 0$aUndergraduate Topics in Computer Science,$x2197-1781 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aMachine theory 606 $aMathematics$xData processing 606 $aLogic, Symbolic and mathematical 606 $aDiscrete Mathematics in Computer Science 606 $aFormal Languages and Automata Theory 606 $aComputational Science and Engineering 606 $aDiscrete Mathematics 606 $aMathematical Logic and Foundations 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aMachine theory. 615 0$aMathematics$xData processing. 615 0$aLogic, Symbolic and mathematical. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aFormal Languages and Automata Theory. 615 24$aComputational Science and Engineering. 615 24$aDiscrete Mathematics. 615 24$aMathematical Logic and Foundations. 676 $a004.0151 700 $aMakinson$b David$f1941-$4aut$4http://id.loc.gov/vocabulary/relators/aut$0849347 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910409668503321 996 $aSets, Logic and Maths for Computing$91896846 997 $aUNINA