hw2 - L-complete if for each , L or L . Assume is...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CISC 404/604 Homework 2 Due on Thursday, March 18, 2010 1. Show a. res (( A B ) ( B C )) (( ¬ C A ) B ). b. { (( A B ) ( C D )) } ‘ res (( A ( C D )) ( B ( C D ))) c. (( ¬ C B ) B ) , ( ¬ C ⇒¬ A ) , (( B ∧ ¬ C ) A ) } ‘ res ( B C ). 2. You may use any of the Theorems/Lemmas/Propositions from the text book up through Proposition 1.12 regarding axiomatic theory L while answering this question. In this ques- tion, Γ is a set of wfs. a. Γ is said to be L-inconsistent if for some wf, α , Γ L α as well as Γ L ¬ α . Show that if Γ is L-inconsistent then for any statement form β , Γ L β . b. We say Γ is
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: L-complete if for each , L or L . Assume is L-complete. Show that (i) if L ( ) then L or L . (ii) if L ( ) then L and L . c. Show that if L i for 1 i n and { 1 ,..., n } | = then L . d. Show L ( A B ) (( C A ) ( C B )). e. Show that if S { } L then S { } L . 1...
View Full Document

This document was uploaded on 12/07/2011.

Ask a homework question - tutors are online