000 04133nam a22005415i 4500
001 978-1-4471-2500-6
003 DE-He213
005 20140220083236.0
007 cr nn 008mamaa
008 120227s2012 xxk| s |||| 0|eng d
020 _a9781447125006
_9978-1-4471-2500-6
024 7 _a10.1007/978-1-4471-2500-6
_2doi
050 4 _aQA76.9.M35 
072 7 _aPBD
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aMakinson, David.
_eauthor.
245 1 0 _aSets, Logic and Maths for Computing
_h[electronic resource] /
_cby David Makinson.
250 _a2nd ed. 2012.
264 1 _aLondon :
_bSpringer London,
_c2012.
300 _aXXI, 283p. 17 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aUndergraduate Topics in Computer Science,
_x1863-7310
505 0 _aCollecting Things Together: Sets -- Comparing Things: Relations -- Associating One Item with Another: Functions -- Recycling Outputs as Inputs: Induction and Recursion -- Counting Things: Combinatorics -- Weighing the Odds: Probability -- Squirrel Math: Trees -- Yea and Nay: Propositional Logic -- Something about Everything: Quantificational Logic -- Just Supposing: Proof and Consequence.
520 _aThis easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduate students need to enter the world of computer and information sciences. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. In ten chapters on these topics, the book guides the student through essential concepts and techniques. The extensively revised second edition provides further clarification of matters that typically give rise to difficulty in the classroom and restructures the chapters on logic to emphasize the role of consequence relations and higher-level rules, as well as including more exercises and solutions. Topics and features: Teaches finite mathematics as a language for thinking, as much as knowledge and skills to be acquired Uses an intuitive approach with a focus on examples for all general concepts Brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction Balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives Includes highlight boxes that raise common queries and clear away confusions Provides numerous exercises, with selected solutions, to test and deepen the reader’s understanding This clearly-written text/reference is a must-read for first-year undergraduate students of computing. Assuming only minimal mathematical background, it is ideal for both the classroom and independent study. Dr. David Makinson is a Visiting Professor in the Department of Philosophy, Logic and Scientific Method at the London School of Economics, UK.
650 0 _aComputer science.
650 0 _aComputational complexity.
650 0 _aAlgebra
_xData processing.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aProbability and Statistics in Computer Science.
650 2 4 _aComputational Mathematics and Numerical Analysis.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781447124993
830 0 _aUndergraduate Topics in Computer Science,
_x1863-7310
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4471-2500-6
912 _aZDB-2-SCS
999 _c100689
_d100689