Compactness Satisfiability and consistency are coextensive Let i be any set of wffs, I is satisfiable iff r is consistent Compactness Theorem T is satisfiable iff every finite subset of r is satisfiable Logic in Computer Science- p10/17Compactness Satisfiability and consistency are coextensive. • Let Γ be any set of wffs, Γ is satisfiable iff Γ is consistent. • Compactness Theorem Γ is satisfiable iff every finite subset of Γ is satisfiable. Logic in Computer Science – p.10/17