This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSE541 PRACTICE FINAL Fall 2010 Solve the problems and then CORRECT your solutions by comparing them with posted solutions. Real Final will have s similar format; STUDY EXERCISES 113 and Examples from chapters 113(part1,2) QUESTION 1 1. For the sentence If it is not true that: 2 + a = a + 3 and today is Monday, then: 2 + a 6 = a + 3 or today is not Monday. write its corresponding formula A . Explain your solution. The formula A is: 2. Define a formal language to which the formula A belongs. The language is: QUESTION 2 Write the formula A from Question 1 as a formula of the language L {¬ , ∪} , i.e. as a formula B of L {¬ , ∪} , such that A ≡ B . Write down all logical equivalences you need while solving this problem. QUESTION 3 H is the following proof system: S = ( L {⇒ , ¬} , A 1 ,A 2 ,A 3 , MP ) A1 ( A ⇒ ( B ⇒ A )) , A2 (( A ⇒ ( B ⇒ C )) ⇒ (( A ⇒ B ) ⇒ ( A ⇒ C ))) , A3 (( ¬ B ⇒ ¬ A ) ⇒ (( ¬ B ⇒ A ) ⇒ B ))) MP Rule of inference: ( MP ) A ; ( A ⇒...
View
Full Document
 Spring '08
 Bachmair,L
 Computer Science, Logic, Proof theory, Intuitionistic Logic, Rs1

Click to edit the document details