The book begins where all discrete math should: with . Nicodemi provides a meticulous introduction to propositional logic, truth tables, and set theory. This foundation ensures that when students move on to more complex topics, they have the linguistic tools necessary to express mathematical ideas precisely. 2. Methods of Proof
Discrete Mathematics by Olympia Nicodemi: A Classic Approach to Logical Foundations
The clear, conversational tone makes it manageable for those studying without a lecturer. Discrete Mathematics by Olympia Nicodemi
While the world of computing has changed drastically since the book's release, the underlying mathematics has not. remains a strong choice for:
First published in the late 1980s, Nicodemi’s work was designed to bridge the gap between high school algebra and the more abstract reasoning required for advanced mathematics and computer science. Why This Text Stands Out The book begins where all discrete math should: with
One of the biggest hurdles for students is the transition from "calculating" to "proving." Nicodemi handles this by introducing various proof techniques—including direct proof, contradiction, and mathematical induction—early and often. The examples are chosen to build confidence, starting with simple parity arguments and moving toward more abstract concepts. 3. Combinatorics and Probability
For those heading into computer science, the chapters on counting (combinatorics) are invaluable. Nicodemi covers permutations, combinations, and the Pigeonhole Principle with a focus on problem-solving strategies that apply to algorithm analysis and complexity. 4. Graph Theory and Relations remains a strong choice for: First published in
In the landscape of computer science and mathematics, few subjects are as foundational as discrete mathematics. While many textbooks have come and gone, remains a respected resource for students and educators seeking a rigorous yet accessible introduction to the field.