Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Automated theorem proving

Related lectures (30)

Introduces Coq, an interactive theorem assistant based on the Curry-Howard isomorphism.

Explores term models, substructures, small model theorems, and the Herbrand model in first-order logic.

By the instructor Viktor Kuncak explores formal verification, program synthesis, and teaching activities at EPFL.

Explores Viktor Kuncak's research in formal verification, program synthesis, and teaching activities at EPFL.

Explores practical automated reasoning systems like TPTP, TSTP, and CASC, emphasizing the importance of consistency and future developments.

Explores the Flyspeck II project, the Kepler Conjecture history, proof certification challenges, and HCL architecture.

Explores the Intermediate Values Theorem for continuous functions on closed intervals.

Introduces Coq and focuses on proving the theorem and_comm step by step.

Explores the practicality and soundness of refinement types, focusing on safe indexing and properties verification.

Covers artificial intelligence fundamentals, emphasizing practical applications and programming exercises.

Covers Markov chains, coupled chains, and their applications, emphasizing the importance of irreducibility.

Explores closed curves in topological spaces, emphasizing their properties and significance in mathematics.

Covers indeterminate forms, logarithmic functions, and the 'role of the gendarmes' theorem.

Introduces formal verification methodology and Presburger arithmetic for program verification and automated reasoning.

Covers challenges in bit-precise reasoning, including SMT-COMP results, AIG, bit-blasting, Tseitin transformation, and complexity classes.

Explores the impact of new technologies on recruitment, emphasizing the importance of fair and accurate tools.

Explores theorem proving in first-order logic and the saturation-based approach, highlighting the Vampire theorem prover.

Covers the application of Cauchy equations and integral decomposition, addressing questions related to holomorphic functions and Jacobian matrices.