MIT24_241F09_lec09

# MIT24_241F09_lec09 - Log ic I Session 9 Plan One more...

This preview shows pages 1–8. Sign up to view the full content.

Logic I - Session 9

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

View Full Document
Plan One more example to practice meta-language proofs Explain mathematical induction Examples
More practice 3.6E (2b) If Γ {P} Q, then Γ P Q 1. Γ {P} Q 2. Every TVA that makes every member of Γ {P} true also makes Q true 3. Every TVA that makes every member of Γ true and P true also makes Q true. 4. No TVA makes every member of Γ true and P true but makes Q false. 5. So no TVA that makes every member of Γ true makes P Q false. 6. So every TVA that makes every member of Γ true also makes P Q true. 7. So Γ P Q

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

View Full Document
Remember: Truth-functional notions are all deﬁned in terms of TVAs (not derivability or possibility) E.g.: Γ is truth-functionally inconsistent iff there’s no TVA that makes every member of Γ true. vs. (The symbol for derivability looks like a piece of a derivation.)
Mathematical induction If we have an ordered sequence of inﬁnitely many things, we can prove that all of them have a property F by proving two simpler claims: Basis clause : Prove that the ﬁrst thing in the sequence is F Inductive step: Prove that if the nth thing is F, then so is the n+1st. Conclude that everything in the sequence is F The things in the sequence can b f SL or sets of sentences SL e anything, e.g. sentences o

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

View Full Document
First Example of MI 6.1E (1a) Prove: No sentence of SL that contains only binary connectives, if any, is truth-functionally false. First step: insert relevant deﬁnitions in the thesis to be proven Prove: No sentence of SL that contains only binary connectives is false on every truth-value assignment Equivalently: Prove: Every sentence of SL that contains only binary connectives is true on some TVA
Second step: Arrange our sentences into a sequence. We can do that by using the number of connectives in the sentences. (This will be a common strategy) Third step: Find our basis clause and inductive clause. We sometimes get them by directly applying our thesis to the members of our sequence. So we might start with:

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 20

MIT24_241F09_lec09 - Log ic I Session 9 Plan One more...

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

View Full Document
Ask a homework question - tutors are online