Completeness of r r is complete iff for any wff A A∈Tor~A∈ ience-p. 3/17Completeness of Γ Γ is complete iff for any wff A A ∈ Γ or ∼ A ∈ Γ Logic in Computer Science – p.3/17