2008/05/05 by Jean Gallier, Gallier, Jean
Computer Science · #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #F.1.1 #F.2.2 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #cs.DM #cs.LO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0805.0585
255 pages
arxiv created 2008/05/05 · openalex publication_date 2008/05/05 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.