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.10.1 Recursive Data (M-I-T)

1.10.4 Structural Induction (M-I-T)

1.10.7 Recursive Functions (M-I-T)

1.11.1 Cardinality (M-I-T)

1.11.11 Set Theory Axioms [Optional] (M-I-T)

1.11.3 Countable Sets (M-I-T)

1.11.4 Cantor's Theorem (M-I-T)

1.11.7 The Halting Problem [Optional] (M-I-T)

1.11.9 Russell's Paradox (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.7.1 Relations (M-I-T)

1.5.4 Predicate Logic 3 (M-I-T)

1.7.3 Relational Mappings (M-I-T)