◼ Motivating examples ◼ Introduction to algorithms ◼ Simplex algorithm ❑ On a particular example ❑ General algorithm ◼ Duality ◼ An application to game theory
Two forms of Completeness Theorem Let Γ be a set of wffs. The following parts are equivalent. If Γ |= A then Γ ` A If Γ is consistent, then Γ is satisfiable