01888nam a2200301 a 4500 vtls000038070 KUKTEM 20251117145416.0 090617t2008 nyua f b 001 0 eng d 9781846288449 1846288444 201107132138 VLOAD 201006151405 jamie 200908141632 VLOAD 200908141606 VLOAD 200906171547 nadia UMP QA76.9.M35 M35 2008 Makinson, David. Sets, logic and maths for computing / by David Makinson New York : Springer, 2008 xv, 301 p. : ill. ; 24 cm. Undergraduate topics in computer science Includes bibliographical references and index Before 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 This 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 Computer science Mathematics Informatique Mathématiques Undergraduate topics in computer science 0 0 0 0 20000 20000 2019-09-04 136.64 2 QA76.9.M35 M35 2008 0000047197 2020-06-25 00:00:00 2020-06-22 1 136.64 2019-09-04 OPEN VIRTUA40 45623 45629 VTLSSORT0080*0200*0201*0400*0900*1000*2450*2600*3000*4900*5040*5050*5200*6500*6501*8300*9991 2