Logic10

Logic10 - Introduction to Logic Lecture 10 Brian...

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

Introduction to Logic Lecture 10 Brian Weatherson, Department of Philosophy October 5, 2009 Logic 201 (Section 5) Lecture 10 1 / 51

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

View Full Document
What are Proofs A proof that an argument is valid is: 1 A sequence of statements; 2 The ﬁrst statements are the premises of the argument; 3 The last statement is the conclusion of the argument; 4 Each statement follows directly from earlier statements; 5 And we say exactly how each statement follows from earlier statements. Logic 201 (Section 5) Lecture 10 2 / 51
Formal Proofs Every sentence is in FOL. We have careful restrictions on what counts as an acceptable move. These restrictions are deﬁned syntactically – i.e., in terms of how the sentences are spelled. There are two moves that go along with each connective. These are called, for reasons that might be mysterious at ﬁrst, introduction and elimination rules. Logic 201 (Section 5) Lecture 10 3 / 51

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

View Full Document
Rules for Logic 201 (Section 5) Lecture 10 4 / 51
-Elimination From A B infer A . We cite the line where A B occurs. Logic 201 (Section 5) Lecture 10 5 / 51

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

View Full Document
-Elimination Also, from A B we can infer B . The same line is cited. Logic 201 (Section 5) Lecture 10 6 / 51
-Introduction From A and B , infer A B . We cite the lines where A and B occur. Logic 201 (Section 5) Lecture 10 7 / 51

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

View Full Document
-Introduction It doesn’t matter which order in the proof A and B turn up in. B could be before A , and you can still infer A B . Logic 201 (Section 5) Lecture 10 8 / 51
-Introduction. Also works for longer conjunctions: From A , B , C infer A B C . Logic 201 (Section 5) Lecture 10 9 / 51

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

View Full Document
Rules for Logic 201 (Section 5) Lecture 10 10 / 51
-Introduction From A , infer A B . We cite the line where A occurs. Logic 201 (Section 5) Lecture 10 11 / 51

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

View Full Document
-Introduction Like with -elimination, there are two versions of this rule. You can also use it to get from B , to A B . In that case, we cite the line where B occurs. Logic 201 (Section 5) Lecture 10 12 / 51
-elimination -elimination is harder. The idea is that if A implies C , and B implies C , then A B implies C . The reason for that is, if you know A B is true, and you know that whichever one of A and B is true, C must follow, then you know that C is true. So the way the rule goes is that from a line that says A B , and a proof of C from A , and a proof of C from B , we can infer C . Logic 201 (Section 5)

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.

This note was uploaded on 02/01/2012 for the course 730 201 taught by Professor Jonwinterbottom during the Fall '11 term at Rutgers.

Page1 / 51

Logic10 - Introduction to Logic Lecture 10 Brian...

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

View Full Document
Ask a homework question - tutors are online