LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Predicates, Sets, and Proofs
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Predicates, Sets, and Proofs

79 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 1

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.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 19 m
Compared with MathematicsLonger than 73%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 1 of 220 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN
Relations and Counting

Relations and Counting

MIT · 79 MIN