Discrete Mathematics for Computer Science, Some Notes

TL;DR

This paper provides an unconventional overview of discrete mathematics tailored for computer scientists, emphasizing proof systems, partial functions, and graph theory fundamentals to support computational reasoning.

Contribution

It introduces a unique presentation style focusing on natural deduction, partial functions, and comprehensive graph theory coverage for better understanding in computer science.

Findings

Highlights the importance of partial functions in computation

Provides a complete account of graph theory concepts

Emphasizes formal proof methods in discrete mathematics

Abstract

These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. Indeed I begin with a discussion of the basic rules of mathematical reasoning and of the notion of proof formalized in a natural deduction system ``a la Prawitz''. The rest of the material is more or less traditional but I emphasize partial functions more than usual (after all, programs may not terminate for all input) and I provide a fairly complete account of the basic concepts of graph theory.