15.08.2013 Views

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

General Computer Science 320201 GenCS I & II Lecture ... - Kwarc

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

means that if the assumption of the Subst rule was valid, then the conclusion is valid as well, i.e.<br />

the validity property is preserved.<br />

Soundness of Substitution<br />

Lemma 318 Subst preserves validity.<br />

Proof: We have to show that [B/X](A) is valid, if A is.<br />

P.1 Let A be valid, B a formula, ϕ: Vo → {T, F} a variable assignment, and ψ :=<br />

ϕ, [Iϕ(B)/X].<br />

P.2 then Iϕ([B/X](A)) = I ϕ,[Iϕ(B)/X](A) = T, since A is valid.<br />

P.3 As the argumentation did not depend on the choice of ϕ, [B/X](A) valid and we have<br />

proven the assertion.<br />

c○: Michael Kohlhase 186<br />

The next theorem shows that the implication connective and the entailment relation are closely<br />

related: we can move a hypothesis of the entailment relation into an implication assumption in the<br />

conclusion of the entailment relation. Note that however close the relationship between implication<br />

and entailment, the two should not be confused. The implication connective is a syntactic formula<br />

constructor, whereas the entailment relation lives in the semantic realm. It is a relation between<br />

formulae that is induced by the evaluation mapping.<br />

The Entailment Theorem<br />

Theorem 319 If H, A |= B, then H |= (A ⇒ B).<br />

Proof: We show that Iϕ(A ⇒ B) = T for all assignments ϕ with Iϕ(H) = T whenever<br />

H, A |= B<br />

P.1 Let us assume there is an assignment ϕ, such that Iϕ(A ⇒ B) = F.<br />

P.2 Then Iϕ(A) = T and Iϕ(B) = F by definition.<br />

P.3 But we also know that Iϕ(H) = T and thus Iϕ(B) = T, since H, A |= B.<br />

P.4 This contradicts our assumption Iϕ(B) = T from above.<br />

P.5 So there cannot be an assignment ϕ that Iϕ(A ⇒ B) = F; in other words, A ⇒ B is<br />

valid.<br />

c○: Michael Kohlhase 187<br />

Now, we complete the theorem by proving the converse direction, which is rather simple.<br />

The Entailment Theorem (continued)<br />

Corollary 320 H, A |= B, iff H |= (A ⇒ B)<br />

Proof: In the light of the previous result, we only need to prove that H, A |= B, whenever<br />

H |= (A ⇒ B)<br />

P.1 To prove that H, A |= B we assume that Iϕ(H, A) = T.<br />

P.2 In particular, Iϕ(A ⇒ B) = T since H |= (A ⇒ B).<br />

P.3 Thus we have Iϕ(A) = F or Iϕ(B) = T.<br />

P.4 The first cannot hold, so the second does, thus H, A |= B.<br />

99

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!