Reference and Selective Reading
You do not need to read the source books front-to-back for this module. Use the concept and practice pages first. Open these local book chunks only when you need the original textbook framing, more worked examples, or a deeper exercise lane.
Source Roles
| Source | Role | Why it is here |
|---|---|---|
| Mathematics for Computer Science | Primary teaching source | Best match for proof templates, quantified logic, sets, functions, and induction with computer-science flavor |
| Discrete Mathematics and Its Applications | Selective support and exercise source | Stronger catalog of definitions, alternate examples, and more exercise volume for relations and proof practice |
Read Only If Stuck
Logic and Quantifiers
- MCS: Propositions from Propositions
- MCS: Equivalence and Validity
- MCS: Predicate Formulas
- Rosen: Predicates and Quantifiers
Proof Construction
- MCS: Proving an Implication
- MCS: Proving an If and Only If / Proof by Cases / Proof by Contradiction
- MCS: Good Proofs in Practice
- Rosen: Introduction to Proofs
Sets, Functions, and Relations
- MCS: Sets
- MCS: Functions
- MCS: Binary Relations
- Rosen: Sets
- Rosen: Functions
- Rosen: Relations and Their Properties
Equivalence and Order
- MCS: Equivalence Relations / Summary of Relational Properties
- MCS: Representing Partial Orders by Set Containment / Product Orders
- Rosen: Equivalence Relations
- Rosen: Partial Orderings
Induction and Recursion
- MCS: Ordinary Induction
- MCS: Strong Induction
- MCS: Strong Induction vs. Induction vs. Well Ordering
- MCS: Recursive Definitions and Structural Induction
- Rosen: Mathematical Induction
- Rosen: Strong Induction and Well-Ordering
- Rosen: Recursive Definitions and Structural Induction
Optional Deep Dive
- MCS: The Algebra of Propositions
- MCS: The Logic of Sets
- MCS: Logical Formulas Problems and References
- MCS: Directed Graphs & Partial Orders Problems and References
- Rosen: Functions (Part 2)
- Rosen: Partial Orderings (Part 2)
Concept-to-Source Map
| Primary concept | Best source if stuck | Why this source |
|---|---|---|
| Propositions, implication, and equivalence | MCS: Propositions from Propositions | Cleanest short entry into proposition shape and connective behavior |
| Proof strategy starts from theorem shape | MCS: Proving an Implication | Gives direct operational proof templates |
| Sets are models, not just containers | MCS: Sets | Best concise source for membership, subset, and equality reasoning |
| Functions are behavior on a domain | MCS: Functions | Strong on domain, codomain, support, image, and range |
| Relation properties and composition | Rosen: Relations and Their Properties | Clear catalog of reflexive, symmetric, antisymmetric, and transitive tests |
| Ordinary induction is sequential closure | MCS: Ordinary Induction | Best template-focused induction explanation |
| Recursive definitions and structural induction | MCS: Recursive Definitions and Structural Induction | Best bridge between recursive objects and proof structure |