Sets, logic and maths for computing / by David Makinson

By:

Makinson, David

Material type: Text

TextSeries: Undergraduate topics in computer sciencePublication details: New York : Springer, 2008Description: xv, 301 p. : ill. ; 24 cmISBN:

9781846288449
1846288444

Subject(s):

Contents:

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

Summary: 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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 3 )

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Open Shelf	UMPLIB PEKAN	QA76.9.M35 M35 2008 (Browse shelf(Opens below))	1	Available		0000047197

Includes bibliographical references and index

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