TY  - BOOK
AU  - Makinson,David
TI  - Sets, logic and maths for computing
T2  - Undergraduate topics in computer science
SN  - 9781846288449
PY  - 2008///
CY  - New York
PB  - Springer
KW  - Computer science
KW  - Mathematics
KW  - Informatique
KW  - Mathématiques
N1  - 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
N2  - 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
ER  -