Maximal consistent set 1.t is complete iff for any wff a A∈Tor~A∈ 2. fr satisfies (a)r is consistent, and (b) For any wff a r, a is inconsistent with I, then we say that i is consistent and maximal Logic in Computer Science-p.9/19Maximal Consistent Set 1. Γ is complete iff for any wff A A ∈ Γ or ∼ A ∈ Γ 2. If Γ satisfies (a) Γ is consistent, and (b) For any wff A 6∈ Γ, A is inconsistent with Γ, then we say that Γ is consistent and maximal. Logic in Computer Science – p.9/19