Mathematics for Computer Science (Spring 2015) (M-I-T)

• 1.1.1 Welcome to 6.042 (M-I-T)
• 1.1.2 Intro to Proofs: Part 1 (M-I-T)
• 1.1.3 Intro to Proofs: Part 2 (M-I-T)
• 1.2.1 Proof by Contradiction (M-I-T)
• 1.2.3 Proof by Cases (M-I-T)
• 1.3.1 Well Ordering Principle 1 (M-I-T)
• 1.3.3 Well Ordering Principle 2 (M-I-T)
• 1.3.5 Well Ordering Principle 3 (M-I-T)
• 1.4.1 Propositional Operators (M-I-T)
• 1.4.3 Digital Logic (M-I-T)
• 1.4.4 Truth Tables (M-I-T)
• 1.5.1 Predicate Logic 1 (M-I-T)
• 1.5.2 Predicate Logic 2 (M-I-T)
• 1.5.4 Predicate Logic 3 (M-I-T)
• 1.6.1 Sets Definitions (M-I-T)
• 1.6.2 Sets Operations (M-I-T)
• 1.7.1 Relations (M-I-T)
• 1.7.3 Relational Mappings (M-I-T)
• 1.7.5 Finite Cardinality (M-I-T)
• 1.8.1 Induction (M-I-T)
• 1.8.2 Bogus Induction (M-I-T)
• 1.8.4 Strong Induction (M-I-T)
• 1.8.6 WOP vs Induction [optional] (M-I-T)
• 1.9.3 Derived Variables (M-I-T)
• 1.10.1 Recursive Data (M-I-T)