
Predicates, Sets, and Proofs
Zachary Abel opens MIT's 6.1200J Mathematics for Computer Science with the question of what counts as a proof. He defines propositions, logical deductions, and axioms, then builds up predicate logic from scratch, showing how to combine predicates with connectives and quantifiers and how to construct and chain implications. The lecture works through the formal apparatus students will use all term, pairing abstract definitions with worked examples on the board to show how a chain of logical steps becomes a valid argument. Running just under eighty minutes, it sets the groundwork for the discrete mathematics and proof techniques that the rest of the course builds on, aimed at computer science students who need rigorous argument as a working tool rather than an abstract exercise.