Sets, logic and maths for computing

This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with pr...

Full description

Bibliographic Details
Main Author: Makinson, David , 1941- (Author)
Format: Book
Language:English
Published: London ; New York : Springer , c2012
Edition:2nd ed
Series:Undergraduate topics in computer science
Subjects:

MARC

LEADER 00000cam a2200000 7i4500
001 0000079005
005 20130407093000.0
008 120627s2012 enk eng
020 |a 1447124995 (paperback : alk. paper) 
020 |a 1447125002 (ebook) 
020 |a 9781447124993 (paperback : alk. paper) 
020 |a 9781447125006 (ebook) 
050 0 0 |a QA76.9.M35   |b M35 2012 
090 0 0 |a QA76.9.M35   |b M35 2012 
100 1 |a Makinson, David ,   |d 1941- ,   |e author 
245 1 0 |a Sets, logic and maths for computing   |c by David Makinson 
250 |a 2nd ed 
260 |a London ;   |a New York :   |b Springer ,   |c c2012 
300 |a xxi, 283 p :   |b ill. ;   |c 24 cm. 
490 1 |a Undergraduate topics in computer science 
504 |a Includes bibliographical references and index 
505 0 |a 1. Collecting things together: sets -- 2. Comparing things: relations -- 3. Associating one item with another: functions -- 4. Recycling outputs as inputs: induction and recursion -- 5. Counting things: combinatorics -- 6. Weighing the odds: probability -- 7. Squirrel math: trees -- 8. Yea and nay: propositional logic -- 9. Something about everything: quantificational logic -- 10. Just supposing: proof and consequence 
520 |a This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. Features: teaches finite math as a language for thinking, as much as knowledge and skills to be acquired; uses an intuitive approach with a focus on examples for all general concepts; brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction; balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives; includes highlight boxes that raise common queries and clear confusions; provides numerous exercises, with selected solutions 
650 0 |a Computer science   |x Mathematics 
999 |a 1000152387   |b Book   |c OPEN SHELF (30 DAYS)   |e Tembila Campus