Lesson_Eight_and_Test - LESSON 8 Truth-functional Logic...

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

View Full Document Right Arrow Icon
Section 15: Formal Deductions , Barker, pp. 94-98. ***Read the section, then the following additional comments. Try not to let the process of formal deductions intimidate you too much. The key to it is not so much one of skill as perception; viz. to learn to look at a line and see what potential it might carry for a simple argument or an equivalence. Ultimately, you may have to go through a bit of trial and error before being able to complete some of the deductions. There is no substitute for being familiar with the simple arguments and equivalences. If you get stuck, take time out to review the material on the fly leafs of the inside front cover or on pp. 99-96. Remember, they all work. Keep in mind that you can always insert a tautology. Every step needs to come with a justification. You can’t just add a line just because it seems “obviously” true. If so, you should be able to prove it with a justification. You can’t perform simple arguments on parts of lines. If you have two lines, such as G e (C > F) and C you can’t just do a modus ponens and get G e F. The reason is that, even though “C” is considered true, you don’t know whether “C > F” is true since it only appears as a part of a disjunction. Remember, all of the exercises in this section are valid. Let’s now look at an example. We want to prove that the following argument is valid: If either Johnny is very quiet or he took a good nap, then he will not be sent to bed on time. He will be sent to bed on time. Therefore, he is not very quiet. We symbolize this argument as: 1. (Q e N) > -B premise [ -Q] 2. B premise 1 LESSON 8 Truth-functional Logic, Part 3
Background image of page 1

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

View Full DocumentRight Arrow Icon
Looking at the premises, we can see that -B is the consequent of the first line, and B is given in the second line. So we can perform a modus tollens. 3. -(Q e N) from 1, 2 by modus tollens Now, if we have our mind geared to recognizing equivalences, we should see that here we have potential for application of DeMorgan’s law. So we get: 4. from 3 by DeMorgan’s law Now we can simplify this expression: 5. -Q from 4 by conjunctive simplification. There’s our conclusion already. Here’s another example: It is not the case that we will go to the zoo if and only if we drive to Ft. Wayne. We do go to the zoo. Therefore, we do not drive to Ft. Wayne. 1. -(Z = D) premise [ -D] 2. Z premise Clearly, there’s not much we can do until we break up premise 1. Then we get by equivalence: 3. from 1 by equivalence Now we can apply the reverse of DeMorgan’s law to this expression. 4.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/19/2011 for the course PHIL 201E taught by Professor Brentkelly during the Spring '11 term at Taylor University Fort Wayne.

Page1 / 8

Lesson_Eight_and_Test - LESSON 8 Truth-functional Logic...

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

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