Sets, logic and maths for computing /

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 . - 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

9781846288449 1846288444


Computer science--Mathematics
Informatique--Mathématiques

Perpustakaan Universiti Malaysia Pahang Al-Sultan Abdullah
26600 Pekan, Pahang Darul Makmur
Phone: +609 431 5063 (Gambang) / +609 431 5035 (Pekan)
Email: umplibrary@umpsa.edu.my

Connect With Us