000 03286nam a22004695i 4500
001 978-3-642-29840-0
003 DE-He213
005 20140220083317.0
007 cr nn 008mamaa
008 120913s2012 gw | s |||| 0|eng d
020 _a9783642298400
_9978-3-642-29840-0
024 7 _a10.1007/978-3-642-29840-0
_2doi
050 4 _aQA76.9.M35
072 7 _aUYA
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT003000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aPace, Gordon J.
_eauthor.
245 1 0 _aMathematics of Discrete Structures for Computer Science
_h[electronic resource] /
_cby Gordon J. Pace.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aXVI, 293 p. 15 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
505 0 _aWhy Mathematics? -- Propositional Logic -- Predicate Calculus -- Sets -- Relations -- Classifying Relations -- More Discrete Structures -- Defining New Structured Types -- Numbers -- Reasoning About Programs -- Index.
520 _aMathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science. The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs. The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aLogic, Symbolic and mathematical.
650 1 4 _aComputer Science.
650 2 4 _aMathematics of Computing.
650 2 4 _aTheory of Computation.
650 2 4 _aMathematical Logic and Foundations.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642298394
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-29840-0
912 _aZDB-2-SCS
999 _c103093
_d103093