Discrete Mathematics for Computer Science, Some Notes

@misc{citeulike:2759927, 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.}, author = {Gallier, Jean }, citeulike-article-id = {2759927}, eprint = {0805.0585}, keywords = {compsci, cs, math, notes}, month = {May}, posted-at = {2008-05-06 13:45:17}, priority = {2}, title = {Discrete Mathematics for Computer Science, Some Notes}, url = {http://arxiv.org/abs/0805.0585}, year = {2008} }

TY - ELEC ID - citeulike:2759927 TI - Discrete Mathematics for Computer Science, Some Notes N2 - 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. KW - compsci KW - cs KW - math KW - notes AU - Gallier, Jean PY - 2008/May/05/ UR - http://arxiv.org/abs/0805.0585 ER -