Discrete Structures for Computer Science: Counting, Recursion, and Probability by Michiel Smid
Discrete Structures for Computer Science: Counting, Recursion, and Probability by Michiel Smid
English | July 30, 2018 | ISBN: N/A | 384 Pages | PDF | 1.3 MB
English | July 30, 2018 | ISBN: N/A | 384 Pages | PDF | 1.3 MB
This book provides a broad introduction to some of the most fascinating and beautiful areas of discrete mathematical structures. It starts with a chapter on sets and goes on to provide examples in logic, applications of the principle of inclusion and exclusion and finally the pigeonhole principal.
Computational techniques including the principle of mathematical introduction are provided, as well as a study on elementary properties of graphs, trees and lattices. Some basic results on groups, rings, fields and vector spaces are also given, the treatment of which is intentionally simple since such results are fundamental as a foundation for students of discrete mathematics. In addition, some results on solutions of systems of linear equations are discussed.
The author strives to change the way logic and discrete math are taught in computer science and mathematics: while many books treat logic simply as another topic of study, this one is unique in its willingness to go one step further. The book traets logic as a basic tool which may be applied in essentially every other area.