Concept
Theory (mathematical logic)
Related lectures (13)
Term Models for First-Order Logic
Explores term models, substructures, small model theorems, and the Herbrand model in first-order logic.
Automating First-Order Logic Proofs Using Resolution
Covers first-order logic, resolution proofs, Skolem functions, and satisfiability checking in mathematics and program verification.
Automating First-Order Logic Proofs Using Resolution
Covers first-order logic syntax, semantics, Skolemization, resolution, and normal form transformations.
Hoare Logic: Strongest Postcondition and Weakest Precondition
Covers Hoare logic, strongest postcondition, and weakest precondition for simplifying proofs in imperative programming.
1st Order System Response: Step and Ramp
Explores the response of a first-order system to step and ramp inputs.
Automating First-Order Logic Proofs Using Resolution
Covers first-order logic syntax, semantics, and resolution for proving properties.
Rule Systems, Simulations, and Parallel Worlds
Delves into rule systems, simulations, and parallel worlds, exploring Prolog, backtracking algorithms, logic complexity, the Game of Life simulation, and the concept of Simulats.
Functional Programming: Concepts and History
Explores imperative programming limitations, theories without mutation, functional programming principles, and the history of functional languages.