exercise10 - CSE541 EXERCISE 10 Covers Chapters 10, 11, 12...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE541 EXERCISE 10 Covers Chapters 10, 11, 12 Read and learn all examples and exercises in the chapters as well! QUESTION 1 Let GL be the Gentzen style proof system for classical logic defined in chapter 11. Prove, by constructing a proper decomposition tree that (1) GL (( ¬ a b ) ( ¬ b a )). (2) 6 ‘ GL (( a b ) ( ¬ b a )) . QUESTION 2 Show that tree below do not constitute a proof in GL defined in chapter 11. T A -→ ¬¬ (( ¬ a b ) ( ¬ b a )) | ( → ¬ ) ¬ (( ¬ a b ) ( ¬ b a )) -→ | ( ¬ → ) -→ (( ¬ a b ) ( ¬ b a )) | ( →⇒ ) ( ¬ a b ) -→ ( ¬ b a ) | ( →⇒ ) ( ¬ a b ) , ¬ b -→ a | ( ¬ → ) ( ¬ a b ) -→ b,a ^ ( ⇒-→ ) -→ ¬ a,b,a | ( → ¬ ) a -→ b,a axiom b -→ b,a axiom 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
QUESTION 3 Let GL be the Gentzen style proof system for classical logic defined in chapter 11. Prove, by constructing a counter-model defined by a proper decomposition tree that 6| = (( a ( ¬ b a )) ( ¬ b ( a b ))) . QUESTION 4 Consider a system RS1 obtained from RS by changing the sequence Γ
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/12/2011 for the course CSE 541 taught by Professor Bachmair,l during the Spring '08 term at SUNY Stony Brook.

Page1 / 2

exercise10 - CSE541 EXERCISE 10 Covers Chapters 10, 11, 12...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online