This preview shows pages 1–9. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CHAPTER 8 System H 2 and Formal Proofs Hilbert System H 2 The system H 1 is sound and strong enough to prove the Deduction Theorem, but it is not complete. We extend now its set of logical axioms to a complete set of axioms , i.e. we define a system H 2 that is complete with respect to classical semantics. The proof of completeness will be presented in the next chapter. 1 Definition of the system H 2 . H 2 = ( 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 B ) B , A,B,C are any formulas of the propositional language L { , } . 2 We write H 2 A to denote that a formula A has a formal proof in H 2 (from the set of logical axioms A 1 ,A 2 ,A 3), and H 2 A to denote that a formula A has a formal proof in H 2 from a set of formulas (and the set of logical axioms A 1 ,A 2 ,A 3). 3 Observe that system H 2 is obtained by adding axiom A 3 to the system H 1 . Hence the Deduction Theorem holds for sys tem H 2 . Deduction Theorem for H 2 For any subset of the set of formulas F of H 2 and for any formulas A,B F , , A H 2 B if and only if H 2 ( A B ) . In particular, A H 2 B if and only if H 2 ( A B ) . 4 Obviously, the axioms A 1 ,A 2 ,A 3 are tautolo gies, and the Modus Ponens rule leads from tautologies to tautologies, hence our proof system H 2 is sound i.e. the following the orem holds. Soundness Theorem for H 2 For every formula A F , if H 2 A, then  = A. 5 The soundness theorem proves that the sys tem produces only tautologies. We show, in the next chapter, that our proof sys tem H 2 produces not only tautologies, but that all tautologies are provable in it. This is called a completeness theorem for classical logic. Completeness Theorem for H 2 For every A F , H 2 A, if and only if  = A. 6 The proof of completeness theorem (for a given semantics) is always a main point in any logic creation. There are many ways (techniques) to prove it, depending on the proof system, and on the semantics we define for it. We present in the next chapter two proofs of the completeness theorem for our system H 2 . The proofs use very different techniques, hence the reason of presenting both of them. In fact the proofs are valid for any proof sys tem for classical propositional logic in which one can prove all formulas proved in the next section. 7 FORMAL PROOFS IN H 2 Examples and Exercises We present here some examples of formal proofs in H 2 . There are two reasons for present ing them....
View
Full
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.
 Spring '08
 Bachmair,L
 Computer Science

Click to edit the document details