%0 Book %1 gallier2008discrete %A Gallier, Jean %D 2008 %K book discrete mathematics notes readings %T Discrete Mathematics for Computer Science, Some Notes %U http://arxiv.org/abs/0805.0585 %X 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.

@book{gallier2008discrete, 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.}, added-at = {2020-09-27T22:48:07.000+0200}, author = {Gallier, Jean}, biburl = {https://www.bibsonomy.org/bibtex/2c5f37a084830bc0181b610bd59308e8f/kirk86}, description = {[0805.0585] Discrete Mathematics for Computer Science, Some Notes}, interhash = {967004fafdc4d62d3d9688fef6d6d9fe}, intrahash = {c5f37a084830bc0181b610bd59308e8f}, keywords = {book discrete mathematics notes readings}, note = {cite arxiv:0805.0585Comment: 255 pages}, timestamp = {2020-09-27T22:48:07.000+0200}, title = {Discrete Mathematics for Computer Science, Some Notes}, url = {http://arxiv.org/abs/0805.0585}, year = 2008 }