ConceptTheory & Algos
Mathematical proof
Proofs are strings satisfying some special syntactic property derived from axioms using inference rules.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Tom Leighton
A verification of a proposition by a chain of logical deductions from a set of axioms.
Lectures that assume it
17The first 12 are shown.
- Constructing Statements and Proofs
- Course Overview, Interval Scheduling
- Strong Induction
- Matching Problems
- A Solution to the Stable Marriage Problem
- Graph Theory II: Minimum Spanning Trees
- Regular Pumping Lemma, Conversion of FA to Regular Expressions
- Logical Notation and Quantifiers
- Probability Densities and BLR Linearity Testing
- The Role of Computer Assistance in Mathematical Proofs
- Graph Theory III
- Proofs, Eigenvalues, and PageRank
Connections
26The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures19
- Introduction and Proofs
- Proofs, Knowledge, and Computation: Zero-Knowledge Interactive Systems
- Constructing Statements and Proofs
- Course Overview, Interval Scheduling
- Strong Induction
- Matching Problems
Show 13 moreShow fewer
- A Solution to the Stable Marriage Problem
- Graph Theory II: Minimum Spanning Trees
- Regular Pumping Lemma, Conversion of FA to Regular Expressions
- Logical Notation and Quantifiers
- Probability Densities and BLR Linearity Testing
- The Role of Computer Assistance in Mathematical Proofs
- Graph Theory III
- Proofs, Eigenvalues, and PageRank
- Linear Independence, Span, and Null Spaces
- The Complexity of Simplicity in Mathematical Logic
- (Re)imagining Mathematics in a World of Reasoning Machines
- Mathematics and Metamathematics of Our Physics Project
- Cryptographic Proofs, Lattices & Hardness Assumptions: A Polylogue