Introduction To Finite Mathematics
by J. G. Kemeny, J. L. Snell, G. L. Thompson
Publisher: Prentice-Hall 1974
The purpose of this book is to introduce college students to the elementary theory of logic, sets, probability theory, and linear algebra and to treat a number of practical applications either from everyday situations or from applications to the biological and social sciences.
Home page url
Download or read it online for free here:
(multiple PDF files)
by A.F. Pixley - Harvey Mudd College
This text is an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and computer programming.
by Jean Gallier - arXiv
These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.
by Eric Lehman, F Thomson Leighton, Albert R Meyer - MIT
An introduction to discrete mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: sets, functions, number theory; Discrete structures: graphs, counting; Discrete probability theory.
by Miguel A. Lerma
Summary of the course CS 310: Mathematical Foundations of Computer Science. It covers concepts of discreet mathematics and applications to computer science, logic and Boolean circuits, functions, sets, relations, databases, finite automata, and more.