Definitions(continued 1. a set t of wff is satisfiable in i iff there is an assignment o∈∑ r such that for all B∈T (工,o) B 2.a set t of wff is satisfiable iff there is an interpretation I such that r of wff is satisfiable n⑦ 3. a sett of wff is unsatisfiable iff it is not satisfiable 4. a model for a set of wffs is an interpretation in Which each of the wffs is valid 5. I logically implies A (T F A)iff fc or ever interpretation I and every g∈∑r,F(xo)A provided that F(I, o B for every B. gic in Computer Science-p. 9/18Definitions (continued) 1. A set Γ of wff is satisfiable in I iff there is an assignment σ ∈ ΣI such that for all B ∈ Γ, |=(I,σ) B. 2. A set Γ of wff is satisfiable iff there is an interpretation I such that Γ of wff is satisfiable in I. 3. A set Γ of wff is unsatisfiable iff it is not satisfiable. 4. A model for a set of wffs is an interpretation in which each of the wffs is valid. 5. Γ logically implies A (Γ |= A) iff for every interpretation I and every σ ∈ ΣI, |=(I,σ) A provided that |=(I,σ) B for every BLogic . in Computer Science – p.9/18