Theorem Proving and VampireExplores theorem proving in first-order logic and the saturation-based approach, highlighting the Vampire theorem prover.
FSM Design and SynthesisCovers the design and synthesis of Finite State Machines, including completeness, consistency, ghost states, and transition tables.
Propositional ResolutionExplores completeness in propositional logic, resolution on clauses, conjunctive form, unit resolution, SAT solvers, and proof generation.
Differential Equations: Part 2Explores Peano's existence theorem, compactness properties, uniqueness of solutions, Ascoli-Arzela theorem, and ripeness in differential equations.
Special Families of ModelsExplores completeness, minimal sufficiency, and special statistical models, focusing on exponential and transformation families.
FSM Design and SynthesisCovers the design and synthesis of Finite State Machines, emphasizing completeness, consistency, and ghost states.
