Two forms of Completeness Theorem Let i be a set of wffs. The following parts are equivalent If r a then Th A Ifr is consistent thent is satisfiable Logic in Computer Science - p 3/21Two 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. Logic in Computer Science – p.3/21