Discrete Mathematics for Computer Science, Some Notes

Simple item page
dc.creatorGallier, Jean
dc.date2008-05-05
dc.date.accessioned2026-07-07T09:37:06Z
dc.date.available2026-07-07T09:37:06Z
dc.descriptionThese 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.
dc.description255 pages
dc.identifierhttps://arxiv.org/abs/0805.0585
dc.identifierhttp://arxiv.org/abs/0805.0585
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160343
dc.subjectDiscrete Mathematics
dc.subjectLogic in Computer Science
dc.subjectF.2.2; F.1.1
dc.titleDiscrete Mathematics for Computer Science, Some Notes
dc.typetext

Files

Collections

arXiv