## Discrete Mathematics for Computer ScientistsThis is a new edition of a successful introduction to discrete mathematics for computer scientists, updated and reorganised to be more appropriate for the modern day undergraduate audience. Discrete mathematics forms the theoretical basis for computer science and this text combines a rigorous approach to mathematical concepts with strong motivation of these techniques via practical examples. Key Features - Thorough coverage of all area of discrete mathematics, including logic, natural numbers, coding theory, combinatorics, sets, algebraic functions, partially ordered structures, graphs, formal machines & complexity theory
- Special emphasis on the central role of propositional & predicate logic
- Full chapters on algorithm analysis & complexity theory
- Introductory coverage of formal machines & coding theory
- Over 700 exercises
- Flexible structure so that the material can be easily adapted for different teaching styles.
- Improved treatment of induction
- Coverage of more 'basic' algebra
- List of symbols including page references for definition/explantion
- Modern text design and new exercises to aid student comprehension
0201360616B04062001 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

The natural numbers | 1 |

Introductory logic | 48 |

Sets relations and functions | 85 |

Copyright | |

18 other sections not shown

### Common terms and phrases

addition and multiplication adjacency matrix algorithm apply binary boolean algebra calculate Chapter circuit clause codeword colours corresponding countable deduce defined definition digits digraph domain edges elements encoding equal equation equivalence classes equivalence relation eulerian path example Exercises expression F F F F T F finite formula function f give given graph hamiltonian Hence induction hypothesis Induction step infinite input inverse isomorphic language Lemma length linear transformation matrix means method natural numbers notation notion obtain operations output partially ordered set path permutation planar graph polynomial positive integer possible predicate logic primitive recursive primitive recursive functions probability problem proof properties propositional logic propositional variables Prove radix real numbers register machine result Section semigroup sequence Show shown in Figure solution strings subset Suppose symbols Theorem tree truth table Turing machine vector space vertex vertices