# Discrete Mathematics

These notes are suitable for a first or second year course on discrete mathematics that discusses the mathematics behind computing science.

It includes chapters on logic, set theory, natural numbers, proofs, counting techniques such as inclusion-exclusion, graph algorithms and Boolean algebra.

[Please note that all links are to Adobe .pdf documents. They will open in a separate browser window.]

- Introduction and Contents
- CHAP01 Logic
- CHAP02 Numbers
- CHAP03 Binary Arithmetic
- CHAP04 Sets, Functions and Relations
- CHAP05 Counting
- CHAP06 Graphs
- CHAP07 Graph Algorithms
- CHAP08 Boolean Algebra