Hypha

hypha

Lecture 1: Predicates, Sets, and Proofs

1:18:46 Free

This lecture explores what a proof is. It defines proofs, propositions, logical deductions, and axioms and delves into predicate logic. It explores how to use and combine prepositions and how to use implications.

Source: Zachary Abel, Mathematics for Computer Science (MIT: OpenCourseWare). Licensed under CC BY-NC-SA 4.0.

Hypha Official

Watch what matters. Create what pays.

MIT 6.1200J: Mathematics for Computer Science

This course covers elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science. Topics include logical notation, sets, relations, elementary graph theory, state machines and invariants, induction and proofs by contradiction, recurrences, asymptotic notation, elementary analysis of algorithms, elementary number theory and cryptography, permutations and combinations, counting tools, and discrete probability.