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 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.

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

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

Covers the joint equidistribution of CM points in algebraic structures and quadratic forms.

Explores the applications of Green's Theorem in 2D, emphasizing the importance of regular domains for successful integration.

Covers minimizing total cost, selecting optimal action sequences, and system feasibility.

Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.

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 elastic and inelastic collisions, kinetic energy conservation, and work principles with practical examples.