01567nam a2200241 a 4500001001400000003000700014005001700021008004100038020001800079020001500097040000800112100002100120245006100141260003200202300003300234490004500267504005000312505053600362520031400898650003401212650003401246830004501280vtls000038070KUKTEM20251117145416.0090617t2008    nyua   f b    001 0 eng d  a9781846288449  a1846288444  aUMP1 aMakinson, David.10aSets, logic and maths for computing /cby David Makinson  aNew York :bSpringer,c2008  axv, 301 p. :bill. ;c24 cm.1 aUndergraduate topics in computer science  aIncludes bibliographical references and index0 aBefore the Beginning.- Do I really need to know about this?.- Proving and disproving: Logical techniques.- Proving and disproving: Mathematical techniques.- First Steps.- Flat set theory.- Families of sets.- Relations.- Functions.- Structures.- Order.- Trees.- Graphs.- Logic.- Truth-functional connectives.- Quantifiers.- Counting.- The pigeonhole principles.- The addition and multiplication rules.- Selection rules.- Probability.- The Kolmogorov axioms for finitely additive probability.- Combining combinatorics and probability  aThis easy-to-follow text allows readers to carry out their computing studies with a clear understanding of the basic finite mathematics and logic that they will need. Written explicitly for undergraduates, it requires only a minimal mathematical background and is ideal for self-study as well as classroom use 0aComputer sciencexMathematics 6aInformatiquexMathématiques 0aUndergraduate topics in computer science