Module 1: Proof Techniques & Discrete Structures
This page aggregates the generated reference routes used by the learner-facing module.
- Semester:
semester-01-math-foundations - App:
foundations
Read only if stuck
- MCS: Propositions from Propositions
- MCS: Equivalence and Validity
- MCS: Predicate Formulas
- Rosen: Predicates and Quantifiers
- 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
- MCS: Sets
- MCS: Functions
- MCS: Binary Relations
- Rosen: Sets
- Rosen: Functions
- Rosen: Relations and Their Properties
- MCS: Equivalence Relations / Summary of Relational Properties
- MCS: Representing Partial Orders by Set Containment / Product Orders
- Rosen: Equivalence Relations
- Rosen: Partial Orderings
- 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