Unformatted text preview: T → A in GL for a formula A below. A = (( a ∩ ¬ b ) ⇒ ( ¬ a ∪ b )) QUESTION 3 Prove the COMPLETENESS theorem for GL. Assume that the Soundness has been already proved. QUESTION 4 Show that ‘ LI (( ¬ A ∪ B ) ⇒ ( A ⇒ B )) . 1...
View
Full Document
 Spring '08
 Bachmair,L
 Computer Science, Logic, Mathematical logic, Proof theory, Kurt Gödel, decomposition tree T→A

Click to edit the document details