Mathematical structures for computer science / Judith L. Gersting.

Table of content
1:Formal logic
1.1 statements, symbolic representation and tautologies
1.2 propositional logic
1.3 qualifiers, predicates and validity
1.4 predicate logic
1.5 logic programming
1.6 proof of correctness
2: proofs, recursion, and analysis of algorithms
2.1 proof techniques
2.2 induction
2.3 more on proof of correctness
2.4 recursion and recurrence relations
2.5 analysis of algorithms
3: sets, combinatorics and probability
3.1 sets
3.2 counting
3.3 principles of inclusion and exclusion; pigeonhole principle
3.4 permutations and combinations
3.5 probability
3.6 binomial theorem
4: relations, functions and matrices
4.1 relations
4.2 topological sorting
4.3 relations and database
4.4 functions
4.5 matrices
5: graphs and tress
5.1 graphs and their representation
5.2 tress and their representation
5.3 decision trees
5.4 Huffman codes
6: graph algorithms
6.1 directed graph and binary relations; warshall's algorithm
6.2 Euler path and Hamiltonian circuit
6.3 shortest path and minimal spanning tress
6.4 traversal algorithms
7: Boolean algebra and computer logic
7.1 Boolean algebra structure
7.2 logic networks
7.3 minimisation
8: modelling arithmetic, computation and languages
8.1 algebraic structure
8.2 finite-state machines
8.3 turning machines
8.4 formal languages

index: p710--729