Maximal consistent set Let i be a consistent and maximal set 1.A∈rif卜A 2.A∈rif~A∈T Let r be a set of wffs. the following parts are equivalent I is consistent and maximal T is consistent and complete Logic in Computer Science- p10/19Maximal Consistent Set Let Γ be a consistent and maximal set. 1. A ∈ Γ iff Γ ` A 2. A ∈ Γ iff ∼ A 6∈ Γ Let Γ be a set of wffs. The following parts are equivalent. • Γ is consistent and maximal. • Γ is consistent and complete. Logic in Computer Science – p.10/19