# Chapter 8 - Sentential Truth Tables and Argument Forms

Size: px
Start display at page:

Transcription

1 Logic: A Brief Introduction Ronald L. Hall Stetson University Chapter 8 - Sentential ruth ables and Argument orms 8.1 Introduction he truth-value of a given truth-functional compound proposition depends on the truth-values of each of its components. One and the same proposition may be true if its components are all true and false if its components are all false. or example, the propositions, he cat is on the mat and the dog is in the yard ( C D ) is true if both the C and the D are true, but false if either C or D is false or if both are false. A complete interpretation of this proposition will track every possible combination and permutation of truth- values. Interpreting compound propositions that are not very complex is fairly easy. When these propositions become complex, interpreting them becomes more difficult. Of any given proposition, the logician should be able to say one of the following: that the proposition is (1) false under every possible interpretation; (2) true under every possible interpretation; or (3) true under some interpretations and false under others. Logicians have given names to these three possible complete interpretations of propositions. A complete interpretation of a proposition will determine that it is a tautology, a contradiction, or a contingent proposition. We define these terms as follows: autology: A proposition that is true under every possible interpretation. Contradiction: A proposition that is false under every possible interpretation. Contingent Proposition: A proposition that is true under some interpretations and false under others. he reason that it is important to know how to recognize these kinds of propositions is because knowing this can be of great help in evaluating arguments. Accordingly, logicians have developed a technique for interpretation that will insure that every possible combination and permutation of truth-values a given proposition can have is considered. his is the technique of interpreting propositions with truth tables. We have already introduced them informally in the last chapter. We used these simple tables to spell out the truth-conditions for conjunctive, disjunctive, conditional, and biconditional propositional forms. Now we need to explain this technique more formally so that we can use this method of tracking truth-values to provide us with reliable and exhaustive interpretations of any given proposition or propositional for 8.2 Constructing ruth ables he technique for constructing a truth table is rather simple and mechanical. here are basically three steps to follow. he first step in this construction process is to determine the number of columns of s and s that the table will have. o the far left of each truth table there will be columns of s and s with one column for each of the simple propositions in the compound proposition that is being interpreted. o the right of this we place one column for the proposition we are tracking. or example if we are interpreting the proposition, (C D) v (C v D) we put one column for C and one column for D. o the right of the column for "D" we put one column for the Chapter 8 p.1

2 proposition we are tracking. So the number of columns is the number of simple propositions in the proposition that is being interpreted and one column for the proposition itself. So in our example our table will have three columns, one for C, one for D, and one for the proposition being tracked. he shell should look like this for our example. C D (C D) v (C v D) It is very important in this process of interpretation that you keep in mind which truth-functional connective is the main one, that is, the one that determines what kind of proposition it is that is being interpreted. his is important because each kind of proposition has different truth conditions. In our example, the main truth functional connective is the wedge. hat is, it is a disjunction. So we know it will be true if either side is true and false only if both disjuncts are false. A complete truth table will give us the complete interpretation of this disjunction, that is, every possible truthvalue it can have. he second step is to determine the number of rows of s and s that our truth table will have. We call each row a row of interpretation. o do this all we need to do is count the number of different simple propositions (that is, the number of different propositional letters) in the proposition or propositional form that we are interpreting and then plug that number into the following formula: 2 n (where n is the number of different propositional letters in the proposition and 2 represents the possible truth-values, and of course there are only two, that is, true and false). or example, if our proposition has 3 different propositional letters, our truth table will have 2 3 rows, that is, 8 rows of interpretation (2 4 =16; 2 5 =32; 2 6 = 64, and so on). or our example we contains two different simple propositions (C and D) so we need to have 4 rows of interpretation. It should look like this: C D (C D) v (C v D) he third step is simply a matter of plugging in values to determine what truth-value the proposition has in each row of interpretation. o accomplish this, we must fill in all the possible combinations and permutations of truth-values that our simple propositions can have. In our example, the first two columns to the far left must represent every possible combination and permutation of 's and 's for "C" and "D". here is a mechanical procedure for insuring that we cover every possibility. Starting with "D" we simply alternate "'s" and "'s" as follows: C D (C D) v (C v D) Moving from right to left, we alternate s and s. hat is, under "C," alternate s and s. When moving to the left we double the s and s as follow: C D (C D) v (C v D) And we just keep doubling as we move to the left in the table. So if we are tracking a proposition that has 3 different simple propositions, we would have to keep doubling as follows: Chapter 8 p.2

3 E D C And of course, if we had 4 simple propositions we would have one more column of s and s and 16 rows of interpretation. he procedure for filling in the rows however stays the same: alternate, then double, then double again, and so forth. Now we are ready to interpret our example proposition. o do this we simply make substitutions of truth-values in the columns of the truth table to the right. After we have made these substitutions of truth-values, we have a complete interpretation of the proposition and can tell if the proposition is a tautology, a contradiction or simply a contingent proposition. Again, this is determined by looking at the column of s and s under the main truth- functional connective. C D (C D) v (C v D) In the process of making correct substitutions of truth-values you must keep in mind what the truth-conditions are for each of our various compound propositions. hat is, you are going to have to remember when conjunctions, disjunctions, conditionals, and so forth are true, and when they are false. Clearly, we see that the only case in which this disjunction is false is when C is true and D is false. his is shown in the third row of interpretation. On the other rows of interpretation, this disjunction is true. his means that the complete interpretation of this proposition shows that it not a tautology or a contradiction but a contingent proposition. hat is, it is true on some interpretations and false on others. (Recall that a tautology has all s in the column under the proposition that is being interpreted, and a contradiction has all s. When we have a mix, we have a contingent proposition, as we do in this case.) Here are some helpful hints to keep in mind in filling out the truth table. irst and foremost determine the main truth-functional connective of the proposition you are interpreting. his will tell you what the truth conditions are for this proposition. or example, if you are interpreting a conditional proposition, you know it will only be false when the antecedent is true and the consequent false. On each row of interpretation, substitute truth values into one side or the other of the main truth-functional connective of the proposition you are interpreting. You might want to work on the simplest side first. his might shorten this process. or example, if you are interpreting a conditional proposition and it clear that on this row of interpretation the consequent is true, then you know that on this row of interpretation this whole conditional must be true. And if the proposition you are interpreting is a disjunction and in the row you are interpreting one side is true, then you know that the value of the whole disjunction on this row must be true. In the Workbook you will be asked to construct some truth tables and interpret the possible truth values for given propositions Chapter 8 p.3

4 8.3 esting for Validity with ruth-ables One of the most important concepts that we can learn in this course, and perhaps the most difficult, is that of validity. As we have said over and over in one way or another, an argument is valid if and only if it is impossible for the premises of that argument to be true and the conclusion false. With the introduction of the various propositional forms, we are now ready to see that this notion of validity has an interesting relation to the conditional propositional form. he form of a conditional proposition, namely its if/then structure, exactly parallels the structure of an argument. Indeed, we read arguments as asserting that if the premises were true, then the conclusion must be true. So every argument has a kind of if/then or conditional structure. here is something further to notice in this parallel. he only time that a conditional proposition is false is when the antecedent is true and the consequent is false. If we take the if part of an argument to parallel the antecedent of a conditional proposition and the then part to parallel the conclusion, we notice that the only case where a conditional proposition is false exactly parallels the only case in which an argument cannot be valid, that is, when its if part is true and its then part is false. Noticing these parallels allows us to come up with the following method for testing the validity of arguments with truth tables. We will say that every argument may be expressed as a conditional proposition. (We must be careful here: a conditional proposition is not an argument, but it may express one.) We express an argument as a conditional proposition by making the antecedent of that proposition a conjunction of the premises of the argument that it is expressing. (If there is only one premise in the argument that we are expressing, then, of course, the antecedent of that conditional proposition will not be a conjunction.) Next, we make the conclusion of the argument that we are expressing the consequent of the conditional proposition. Since no valid argument can have true premises and a false conclusion, and no true conditional proposition can have a true antecedent and a false conclusion, we can see that if an argument is valid, then the conditional proposition that expresses it must be a tautology. his gives us the following rule: An argument is valid if and only if the conditional proposition that expresses it is tautological. So the first step in testing an argument with truth tables is to express that argument as a conditional proposition. Let s see how this works with the following argument: If I go to the movies then I will see Jane. I did go to the movies. herefore, I saw Jane. here are two premises in this argument. So to express this argument as a conditional proposition, we must conjoin these two premises and make them the antecedent of that proposition and make the conclusion the consequent of that proposition. Our expression of this argument as a conditional proposition then looks like this: [(M J) M] J. Now all we have to do is to construct a truth table to give a complete interpretation of this conditional proposition. hat table would look like this: J M [(M J) M] J Now we simply fill in the last column as follows: J M [(M J) M] J Chapter 8 p.4

5 As we know from our definitions above, this table shows that this conditional proposition is a tautology. Having determined that the conditional proposition that expresses the argument we are testing is tautological, we know that the argument is valid. So we now have a mechanical procedure for testing validity. here are three steps in the procedure. All we have to do is: (1) Express the argument we are testing as a conditional proposition; (2) interpret it with a truth table; (3) determine whether or not it is a tautology (it is, if and only if, there are all s in the column below the proposition that is being tracked.) If the conditional proposition is a tautology, the argument it expresses is valid; if it has even one in the column under the conditional proposition being tested the argument it expresses is invalid. ry this: Use a truth table to prove that affirming the consequent is in fact a fallacy. 8.4 A Short-Cut est for Validity he truth table method of testing for validity is fine so long as the number of different proposition letters is limited. In complicated arguments that involve many different propositional letters, the truth table method of testing for validity can become unwieldy. If, for example, we have an argument that involves 6 different propositional letters, our truth table will have 2 6 =64 rows of s and s. Of course the method will work in such complicated tables, but we might prefer a less cumbersome method if one is available. And fortunately one is available. We will call it the short-cut method. If we correctly understand why an argument is valid if the conditional proposition that expresses it is tautological, hen we can readily see how the short-cut method works. he only time that a conditional proposition is false is when the antecedent is true and the consequent is false. hat combination of s and s is not possible if the conditional proposition is tautological. or if that combination did exist, then there would be an in the interpretation of that proposition and it would not be tautological. With these things in mind, then our short-cut method is as follows: Simply assign the consequent of the conditional proposition that expresses the argument we are testing the truthvalue of. (Now whatever the values are that you use to make the consequent false, these same values must be used when we make assignments to the antecedent.) After we have assigned the consequent of the conditional proposition, we then see if there is any way to assign truth values to the propositional letters in the antecedent that will make it true. he values we assigned to the consequent to make it false, must be kept when assigning values to the antecedent. If it is not possible to make the antecedent true when the consequent is false, the argument is valid. If it is possible to make the antecedent true when the consequent is false, then the argument is invalid. OK, let s see how this short-cut method works. At the end of the last section I asked you to construct an argument that that shows that affirming the consequent is an invalid argument. I hope you found this fairly easy to do. Now we can show that such an argument is invalid with our short-cut method of testing for validity. Let s use the following argument to show how we do this. It is a form of the fallacy call the fallacy of affirming the consequent): If I go to the movies then I will see Jane. I did see Jane. herefore, I went to the movies. Expressing this argument as a conditional proposition yields the following symbolic sentential proposition: [(M J) J] M. he conclusion of our argument (M) is here expressed as the consequent of this corresponding conditional proposition. ollowing our short-cut method, we simply assign this consequent, that is, M the truth- value. Now we see if there is any way that we can make assignments to the propositions in the antecedent that will make it true. Having assigned the Chapter 8 p.5

6 value of to M, we must keep that value as we make assignment in the antecedent. If we can do this, the argument is invalid, if not, it is valid. What if we make J true? If we do then M J will be true, and so the conjunction (M J) J will be true when the consequent M is false. his shows that the argument is invalid, for it shows that it is possible for the antecedent to be true when the consequent is false. his short method is particularly useful when we have an argument with more than two or three propositional letters. Consider the following argument: If I go the movies then I will see Jane. If I go to the races, then I will see Sally. I will either go to the movies or to the races. herefore, I will either see Jane or Sally. o express this argument as a conditional proposition we must first symbolize the three premises and conjoin them to make the antecedent of the conditional proposition that will express the argument. hat antecedent would be as follows: [(M J) (R S)] (M v R). Now we make this expression the antecedent of the conditional proposition that expresses this argument, and the conclusion its consequent, and we get this expression: {[(M J) (R S)] (M v R)} (JvS) ollowing the procedure for the short-cut method, we assign the consequent of this conditional proposition the truth value of, and then make truth value assignments to the propositional letters in the antecedent(keeping the assigned values we made in the consequent) to try to make the antecedent true. As it turns out, the only way to make the consequent false in this case is to make both J and S false, since this consequent is a disjunction and for a disjunction to be false, both disjuncts must be false. his means we are free to assign R or M whatever we like, keeping S and J as false. Having made this assignment, our only choices now are to assign truth- values to M and R. Remember, we are trying to make the antecedent true when the consequent is assigned the value. Since the antecedent is a conjunction, it can be true only if all of all of its conjuncts are true. Given that J is assigned the truth-value of, the only way to make the first conjunct M J) true is to make M false. he same reasoning works with the second conditional R S. Given that S is assigned the value of false, the only way to make R S true is to assign R the truth-value of false. Having made these two assignments to M and R the final conjunct M v R of the antecedent, which is itself a disjunction, becomes false. So we see that there is no possible substitution of truth- values for the simple propositions in this conditional proposition that would make it true when the consequent if false. Hence this conditional proposition is tautological, and hence the argument that it expresses is valid. With practice, this short-cut method can be a handy tool for testing validity. 8.5 Argument orms A particular argument contains particular propositions (as its premises and its conclusion). Such particular propositions are about this or that, e.g., cats on mats, dogs in yards, and sealing wax, and are symbolized with upper case letters that remind us of their content. We call these propositional letters. By contrast, an argument form does not contain propositional letters (as its premises and its conclusion). hese propositional argument forms have no particular content. hese propositional argument forms are made by using what we call propositional variable rather than propositional letters. hese propositional variables are symbolized with lower case letters from p-z. or example, D stands for a particular proposition, while p as a variable stands for any proposition whatsoever, even a compound one. p may stand for a disjunction, a conditional, and indeed, any proposition however complicated. In a similar vein, (p v q) stands for any disjunction whatsoever, (p q) for any conditional proposition whatsoever, and so forth. Consider the following particular argument that we will call Argument A and its sentential expression (Here we are introducing the following symbol to stand for therefore. ): Argument A If I go to the movies, then I will see Jane. I went to the movies. herefore I saw Jane. We express Argument A with propositional letters as follows; M J; M; J. Chapter 8 p.6

7 We express Argument A with propositional variables as follows: p q; p; q One important thing to notice here is that there is a one-to-one correspondence between the upper case propositional letters in Argument A and the lower case propositional variables in its corresponding argument form ( p here is standing for M and q is standing for J ). o express this one-to-one correspondence of propositional variables and the proposition letters, we say that the second expression above (lower case letters) represents the specific form of the first expression above in upper case letters. If we determine that a particular argument has a valid form as its specific form, then that argument is valid. In this case, I hope you see that the argument in this example has modus ponens as its specific form and is accordingly valid. he import of this can be generalized as follows: Any particular argument is valid if it is has a valid argument form as its specific form. his is very helpful since, as it happens, there are, surprisingly, only a few valid argument forms that we are likely to encounter amongst the thousands of different arguments that we commonly hear, read, and/or construct. In fact, we have already been introduced to 4 common valid forms: Modus Pones, Modus ollens, Disjunctive Syllogism, and Hypothetical syllogism. So if you recognize a particular argument as having its specific form as one of these valid forms, then you know it is valid. But even though a particular argument does not have a valid form as it specific form, it may be what we will call a substitution instance of a valid form. his has enormous consequences. If an argument is a substitution instance of a valid form then it is valid. So we need to see how to determine if a particular argument is or is not a substitution instance of a valid argument form. his skill will allow us to assess thousands of particular argument as valid. Here is how we do this. We must think of the valid argument forms as telling us what valid moves are open to us in formulating good deductive arguments. ake Modus Pones as an example. If I am assessing a particular argument that has one premise that is a conditional proposition, however, complex, and one premise that is the antecedent of that conditional proposition, then it is a valid move to deduce the consequent of that conditional proposition. he same holds for Modus ollens. If I am assessing a particular argument that has one premise that is a conditional proposition, however, complex, and one premise that negates the consequent of that conditional proposition, then it is a valid move to deduce the negation of the antecedent of that conditional proposition. And we can think of Disjunctive Syllogism and Hypothetical Syllogism along the same lines. Notice that what we are developing here a powerful technique for assessing validity. If any particular argument is a substitution instance of a valid argument form (we now know of 4 such forms, but we will introduce others as we proceed) then it is valid. However, this is not a very useful technique in determining invalidity. So, if we run across an argument that is not a substitution instance of one a valid argument form, we do not know that it is invalid. Indeed, it may be valid or invalid. We can use our short-cut method to determine whether it is valid or not. But this technique does have some use in determining invalidity. If an argument has the specific form of an invalid argument form such as affirming the consequent or denying the antecedent, we can say that it is invalid. But if a particular argument is only a substitution instance of an invalid form it may be valid or invalid. In general: if an argument has the specific form of an invalid form, it will be invalid; if an argument is merely a substitution instance of an invalid form, and does not have that form as its specific form, then we do not know whether it is valid or not. hat is, substitution instances of invalid forms may be valid or invalid. Consider the following example of an argument that is a substitution instance of the invalid form known as affirming the consequent, but is nevertheless a valid argument: If I go to the movies or go to the races, then I will go to the movies and go to the races. I go to the movies and I go to the races. herefore, I either go to the movies or go to the races. We can symbolize this argument as follows: (M v R) (M R)) (M v R) It should be clear to you that this argument is in fact a substitution instance of the invalid argument form of Affirming the Consequent, even though it does not have this specific form. However, in this case, the argument is valid, Chapter 8 p.7

8 and we can easily show this with our short-cut method of determining validity. o use this method we express the argument as a conditional proposition as follows: {[(M v R) (M R)] (M R)} (M v R) Next we assign the truth-value of to the consequent and try to make the antecedent true. If we can, the argument is invalid, if we cannot it is valid. In order to make the consequent here false, we must make both M and R false since the only way a disjunction can be false is for both disjuncts to be false. So we have to make the same assignments to the M and the R in the antecedent. Clearly the conjunction M R is false. However, this conjunction is a conjunct of a larger conjunction. One false conjunct is sufficient to make a conjunction false. Hence when the consequent of this conditional proposition is false, the antecedent cannot be true. Clearly then, the argument that this conditional proposition expresses is valid. As it happens, even though this argument is a substitution instance of the invalid form of affirming the consequent, it is nevertheless a valid argument. Our Workbook will help you master the ideas presented in this chapter. Study Guide for Chapter 8 autology: A proposition that is true under every possible interpretation. Contradiction: A proposition that is false under every possible interpretation. Contingent Proposition: A proposition that is true under some interpretations and false under others. Valid Argument orms (so far) Modus Ponens (MP) p q; p; therefore q Modus ollens (M) p q; q; therefore p Disjunctive Syllogism (DS) p v q; p; therefore q Hypothetical Syllogism (HS) p q; q r; therefore p. Chapter 8 p.8

### Chapter 9- Sentential Proofs

Logic: A Brief Introduction Ronald L. Hall, Stetson University Chapter 9- Sentential roofs 9.1 Introduction So far we have introduced three ways of assessing the validity of truth-functional arguments.

### PART III - Symbolic Logic Chapter 7 - Sentential Propositions

Logic: A Brief Introduction Ronald L. Hall, Stetson University 7.1 Introduction PART III - Symbolic Logic Chapter 7 - Sentential Propositions What has been made abundantly clear in the previous discussion

### Logic: A Brief Introduction

Logic: A Brief Introduction Ronald L. Hall, Stetson University PART III - Symbolic Logic Chapter 7 - Sentential Propositions 7.1 Introduction What has been made abundantly clear in the previous discussion

### Artificial Intelligence: Valid Arguments and Proof Systems. Prof. Deepak Khemani. Department of Computer Science and Engineering

Artificial Intelligence: Valid Arguments and Proof Systems Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Module 02 Lecture - 03 So in the last

### What are Truth-Tables and What Are They For?

PY114: Work Obscenely Hard Week 9 (Meeting 7) 30 November, 2010 What are Truth-Tables and What Are They For? 0. Business Matters: The last marked homework of term will be due on Monday, 6 December, at

### Logic & Proofs. Chapter 3 Content. Sentential Logic Semantics. Contents: Studying this chapter will enable you to:

Sentential Logic Semantics Contents: Truth-Value Assignments and Truth-Functions Truth-Value Assignments Truth-Functions Introduction to the TruthLab Truth-Definition Logical Notions Truth-Trees Studying

### Logic: A Brief Introduction. Ronald L. Hall, Stetson University

Logic: A Brief Introduction Ronald L. Hall, Stetson University 2012 CONTENTS Part I Critical Thinking Chapter 1 Basic Training 1.1 Introduction 1.2 Logic, Propositions and Arguments 1.3 Deduction and Induction

### 9 Methods of Deduction

M09_COPI1396_13_SE_C09.QXD 10/19/07 3:46 AM Page 372 9 Methods of Deduction 9.1 Formal Proof of Validity 9.2 The Elementary Valid Argument Forms 9.3 Formal Proofs of Validity Exhibited 9.4 Constructing

### Chapter 2 Analyzing Arguments

Logic: A Brief Introduction Ronald L. Hall, Stetson University Chapter 2 Analyzing Arguments 2.1 Introduction Now that we have gotten our "mental muscles" warmed up, let's see how well we can put our newly

### Logic Appendix: More detailed instruction in deductive logic

Logic Appendix: More detailed instruction in deductive logic Standardizing and Diagramming In Reason and the Balance we have taken the approach of using a simple outline to standardize short arguments,

### Study Guides. Chapter 1 - Basic Training

Study Guides Chapter 1 - Basic Training Argument: A group of propositions is an argument when one or more of the propositions in the group is/are used to give evidence (or if you like, reasons, or grounds)

### Semantic Entailment and Natural Deduction

Semantic Entailment and Natural Deduction Alice Gao Lecture 6, September 26, 2017 Entailment 1/55 Learning goals Semantic entailment Define semantic entailment. Explain subtleties of semantic entailment.

### INTERMEDIATE LOGIC Glossary of key terms

1 GLOSSARY INTERMEDIATE LOGIC BY JAMES B. NANCE INTERMEDIATE LOGIC Glossary of key terms This glossary includes terms that are defined in the text in the lesson and on the page noted. It does not include

### PHILOSOPHY 102 INTRODUCTION TO LOGIC PRACTICE EXAM 1. W# Section (10 or 11) 4. T F The statements that compose a disjunction are called conjuncts.

PHILOSOPHY 102 INTRODUCTION TO LOGIC PRACTICE EXAM 1 W# Section (10 or 11) 1. True or False (5 points) Directions: Circle the letter next to the best answer. 1. T F All true statements are valid. 2. T

### An alternative understanding of interpretations: Incompatibility Semantics

An alternative understanding of interpretations: Incompatibility Semantics 1. In traditional (truth-theoretic) semantics, interpretations serve to specify when statements are true and when they are false.

### Tutorial A03: Patterns of Valid Arguments By: Jonathan Chan

A03.1 Introduction Tutorial A03: Patterns of Valid Arguments By: With valid arguments, it is impossible to have a false conclusion if the premises are all true. Obviously valid arguments play a very important

### KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Patgaon, Ranigate, Guwahati SEMESTER: 1 PHILOSOPHY PAPER : 1 LOGIC: 1 BLOCK: 2

GPH S1 01 KRISHNA KANTA HANDIQUI STATE OPEN UNIVERSITY Patgaon, Ranigate, Guwahati-781017 SEMESTER: 1 PHILOSOPHY PAPER : 1 LOGIC: 1 BLOCK: 2 CONTENTS UNIT 6 : Modern analysis of proposition UNIT 7 : Square

### MATH1061/MATH7861 Discrete Mathematics Semester 2, Lecture 5 Valid and Invalid Arguments. Learning Goals

MAH1061/MAH7861 Discrete Mathematics Semester 2, 2016 Learning Goals 1. Understand the meaning of necessary and sufficient conditions (carried over from Wednesday). 2. Understand the difference between

### The way we convince people is generally to refer to sufficiently many things that they already know are correct.

Theorem A Theorem is a valid deduction. One of the key activities in higher mathematics is identifying whether or not a deduction is actually a theorem and then trying to convince other people that you

### Lecture 3 Arguments Jim Pryor What is an Argument? Jim Pryor Vocabulary Describing Arguments

Lecture 3 Arguments Jim Pryor What is an Argument? Jim Pryor Vocabulary Describing Arguments 1 Agenda 1. What is an Argument? 2. Evaluating Arguments 3. Validity 4. Soundness 5. Persuasive Arguments 6.

### Recall. Validity: If the premises are true the conclusion must be true. Soundness. Valid; and. Premises are true

Recall Validity: If the premises are true the conclusion must be true Soundness Valid; and Premises are true Validity In order to determine if an argument is valid, we must evaluate all of the sets of

### Logicola Truth Evaluation Exercises

Logicola Truth Evaluation Exercises The Logicola exercises for Ch. 6.3 concern truth evaluations, and in 6.4 this complicated to include unknown evaluations. I wanted to say a couple of things for those

### Selections from Aristotle s Prior Analytics 41a21 41b5

Lesson Seventeen The Conditional Syllogism Selections from Aristotle s Prior Analytics 41a21 41b5 It is clear then that the ostensive syllogisms are effected by means of the aforesaid figures; these considerations

### Revisiting the Socrates Example

Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified

### PHI Introduction Lecture 4. An Overview of the Two Branches of Logic

PHI 103 - Introduction Lecture 4 An Overview of the wo Branches of Logic he wo Branches of Logic Argument - at least two statements where one provides logical support for the other. I. Deduction - a conclusion

### Also, in Argument #1 (Lecture 11, Slide 11), the inference from steps 2 and 3 to 4 is stated as:

by SALVATORE - 5 September 2009, 10:44 PM I`m having difficulty understanding what steps to take in applying valid argument forms to do a proof. What determines which given premises one should select to

### Section 3.5. Symbolic Arguments. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section 3.5 Symbolic Arguments INB able of Contents Date opic Page # July 28, 2014 Section 3.5 Examples 84 July 28, 2014 Section 3.5 Notes 85 July 28, 2014 Section 3.6 Examples 86 July 28, 2014 Section

### A. Problem set #3 it has been posted and is due Tuesday, 15 November

Lecture 9: Propositional Logic I Philosophy 130 1 & 3 November 2016 O Rourke & Gibson I. Administrative A. Problem set #3 it has been posted and is due Tuesday, 15 November B. I am working on the group

### Overview of Today s Lecture

Branden Fitelson Philosophy 12A Notes 1 Overview of Today s Lecture Music: Robin Trower, Daydream (King Biscuit Flower Hour concert, 1977) Administrative Stuff (lots of it) Course Website/Syllabus [i.e.,

### A BRIEF INTRODUCTION TO LOGIC FOR METAPHYSICIANS

A BRIEF INTRODUCTION TO LOGIC FOR METAPHYSICIANS 0. Logic, Probability, and Formal Structure Logic is often divided into two distinct areas, inductive logic and deductive logic. Inductive logic is concerned

### There are two common forms of deductively valid conditional argument: modus ponens and modus tollens.

INTRODUCTION TO LOGICAL THINKING Lecture 6: Two types of argument and their role in science: Deduction and induction 1. Deductive arguments Arguments that claim to provide logically conclusive grounds

### Chapter 3: More Deductive Reasoning (Symbolic Logic)

Chapter 3: More Deductive Reasoning (Symbolic Logic) There's no easy way to say this, the material you're about to learn in this chapter can be pretty hard for some students. Other students, on the other

### HANDBOOK (New or substantially modified material appears in boxes.)

1 HANDBOOK (New or substantially modified material appears in boxes.) I. ARGUMENT RECOGNITION Important Concepts An argument is a unit of reasoning that attempts to prove that a certain idea is true by

### Today s Lecture 1/28/10

Chapter 7.1! Symbolizing English Arguments! 5 Important Logical Operators!The Main Logical Operator Today s Lecture 1/28/10 Quiz State from memory (closed book and notes) the five famous valid forms and

### The antecendent always a expresses a sufficient condition for the consequent

Critical Thinking Lecture Four October 5, 2012 Chapter 3 Deductive Argument Patterns Diagramming Arguments Deductive Argument Patterns - There are some common patterns shared by many deductive arguments

### Criticizing Arguments

Kareem Khalifa Criticizing Arguments 1 Criticizing Arguments Kareem Khalifa Department of Philosophy Middlebury College Written August, 2012 Table of Contents Introduction... 1 Step 1: Initial Evaluation

### PHI 1500: Major Issues in Philosophy

PHI 1500: Major Issues in Philosophy Session 3 September 9 th, 2015 All About Arguments (Part II) 1 A common theme linking many fallacies is that they make unwarranted assumptions. An assumption is a claim

### Introduction Symbolic Logic

An Introduction to Symbolic Logic Copyright 2006 by Terence Parsons all rights reserved CONTENTS Chapter One Sentential Logic with 'if' and 'not' 1 SYMBOLIC NOTATION 2 MEANINGS OF THE SYMBOLIC NOTATION

### MCQ IN TRADITIONAL LOGIC. 1. Logic is the science of A) Thought. B) Beauty. C) Mind. D) Goodness

MCQ IN TRADITIONAL LOGIC FOR PRIVATE REGISTRATION TO BA PHILOSOPHY PROGRAMME 1. Logic is the science of-----------. A) Thought B) Beauty C) Mind D) Goodness 2. Aesthetics is the science of ------------.

### An Introduction to. Formal Logic. Second edition. Peter Smith, February 27, 2019

An Introduction to Formal Logic Second edition Peter Smith February 27, 2019 Peter Smith 2018. Not for re-posting or re-circulation. Comments and corrections please to ps218 at cam dot ac dot uk 1 What

### Logic I or Moving in on the Monkey & Bananas Problem

Logic I or Moving in on the Monkey & Bananas Problem We said that an agent receives percepts from its environment, and performs actions on that environment; and that the action sequence can be based on

### Announcements. CS243: Discrete Structures. First Order Logic, Rules of Inference. Review of Last Lecture. Translating English into First-Order Logic

Announcements CS243: Discrete Structures First Order Logic, Rules of Inference Işıl Dillig Homework 1 is due now Homework 2 is handed out today Homework 2 is due next Tuesday Işıl Dillig, CS243: Discrete

### Logic Book Part 1! by Skylar Ruloff!

Logic Book Part 1 by Skylar Ruloff Contents Introduction 3 I Validity and Soundness 4 II Argument Forms 10 III Counterexamples and Categorical Statements 15 IV Strength and Cogency 21 2 Introduction This

### Unit. Categorical Syllogism. What is a syllogism? Types of Syllogism

Unit 8 Categorical yllogism What is a syllogism? Inference or reasoning is the process of passing from one or more propositions to another with some justification. This inference when expressed in language

### Section 3.5. Symbolic Arguments. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section 3.5 Symbolic Arguments What You Will Learn Symbolic arguments Standard forms of arguments 3.5-2 Symbolic Arguments A symbolic argument consists of a set of premises and a conclusion. It is called

### Part II: How to Evaluate Deductive Arguments

Part II: How to Evaluate Deductive Arguments Week 4: Propositional Logic and Truth Tables Lecture 4.1: Introduction to deductive logic Deductive arguments = presented as being valid, and successful only

### 4.1 A problem with semantic demonstrations of validity

4. Proofs 4.1 A problem with semantic demonstrations of validity Given that we can test an argument for validity, it might seem that we have a fully developed system to study arguments. However, there

### CHAPTER THREE Philosophical Argument

CHAPTER THREE Philosophical Argument General Overview: As our students often attest, we all live in a complex world filled with demanding issues and bewildering challenges. In order to determine those

### Deduction by Daniel Bonevac. Chapter 1 Basic Concepts of Logic

Deduction by Daniel Bonevac Chapter 1 Basic Concepts of Logic Logic defined Logic is the study of correct reasoning. Informal logic is the attempt to represent correct reasoning using the natural language

### Introduction to Philosophy

Introduction to Philosophy Philosophy 110W Russell Marcus Hamilton College, Fall 2013 Class 1 - Introduction to Introduction to Philosophy My name is Russell. My office is 202 College Hill Road, Room 210.

### Truth Tables for Negation, Conjunction, and Disjunction

ruthabelsi.nb 1 ruth ables for Negation, Conjunction, and Disjunction A truth table is a device used to determine when a comound statement is true or false. ive basic truth tables are used in constructing

### HANDBOOK. IV. Argument Construction Determine the Ultimate Conclusion Construct the Chain of Reasoning Communicate the Argument 13

1 HANDBOOK TABLE OF CONTENTS I. Argument Recognition 2 II. Argument Analysis 3 1. Identify Important Ideas 3 2. Identify Argumentative Role of These Ideas 4 3. Identify Inferences 5 4. Reconstruct the

### LOGIC ANTHONY KAPOLKA FYF 101-9/3/2010

LOGIC ANTHONY KAPOLKA FYF 101-9/3/2010 LIBERALLY EDUCATED PEOPLE......RESPECT RIGOR NOT SO MUCH FOR ITS OWN SAKE BUT AS A WAY OF SEEKING TRUTH. LOGIC PUZZLE COOPER IS MURDERED. 3 SUSPECTS: SMITH, JONES,

### Philosophy 1100: Introduction to Ethics. Critical Thinking Lecture 1. Background Material for the Exercise on Validity

Philosophy 1100: Introduction to Ethics Critical Thinking Lecture 1 Background Material for the Exercise on Validity Reasons, Arguments, and the Concept of Validity 1. The Concept of Validity Consider

### Instructor s Manual 1

Instructor s Manual 1 PREFACE This instructor s manual will help instructors prepare to teach logic using the 14th edition of Irving M. Copi, Carl Cohen, and Kenneth McMahon s Introduction to Logic. The

### PHIL 115: Philosophical Anthropology. I. Propositional Forms (in Stoic Logic) Lecture #4: Stoic Logic

HIL 115: hilosophical Anthropology Lecture #4: Stoic Logic Arguments from the Euthyphro: Meletus Argument (according to Socrates) [3a-b] Argument: Socrates is a maker of gods; so, Socrates corrupts the

### Chapter 3: Basic Propositional Logic. Based on Harry Gensler s book For CS2209A/B By Dr. Charles Ling;

Chapter 3: Basic Propositional Logic Based on Harry Gensler s book For CS2209A/B By Dr. Charles Ling; cling@csd.uwo.ca The Ultimate Goals Accepting premises (as true), is the conclusion (always) true?

### Workbook Unit 3: Symbolizations

Workbook Unit 3: Symbolizations 1. Overview 2 2. Symbolization as an Art and as a Skill 3 3. A Variety of Symbolization Tricks 15 3.1. n-place Conjunctions and Disjunctions 15 3.2. Neither nor, Not both

### Introducing Our New Faculty

Dr. Isidoro Talavera Franklin University, Philosophy Ph.D. in Philosophy - Vanderbilt University M.A. in Philosophy - Vanderbilt University M.A. in Philosophy - University of Missouri M.S.E. in Math Education

### HOW TO ANALYZE AN ARGUMENT

What does it mean to provide an argument for a statement? To provide an argument for a statement is an activity we carry out both in our everyday lives and within the sciences. We provide arguments for

### Courses providing assessment data PHL 202. Semester/Year

1 Department/Program 2012-2016 Assessment Plan Department: Philosophy Directions: For each department/program student learning outcome, the department will provide an assessment plan, giving detailed information

### Symbolic Logic. 8.1 Modern Logic and Its Symbolic Language

M08_COPI1396_13_SE_C08.QXD 10/16/07 9:19 PM Page 315 Symbolic Logic 8 8.1 Modern Logic and Its Symbolic Language 8.2 The Symbols for Conjunction, Negation, and Disjunction 8.3 Conditional Statements and

### 5.6.1 Formal validity in categorical deductive arguments

Deductive arguments are commonly used in various kinds of academic writing. In order to be able to perform a critique of deductive arguments, we will need to understand their basic structure. As will be

### SECTION 2 BASIC CONCEPTS

SECTION 2 BASIC CONCEPTS 2.1 Getting Started...9 2.2 Object Language and Metalanguage...10 2.3 Propositions...12 2.4 Arguments...20 2.5 Arguments and Corresponding Conditionals...29 2.6 Valid and Invalid,

### Intersubstitutivity Principles and the Generalization Function of Truth. Anil Gupta University of Pittsburgh. Shawn Standefer University of Melbourne

Intersubstitutivity Principles and the Generalization Function of Truth Anil Gupta University of Pittsburgh Shawn Standefer University of Melbourne Abstract We offer a defense of one aspect of Paul Horwich

### Module 5. Knowledge Representation and Logic (Propositional Logic) Version 2 CSE IIT, Kharagpur

Module 5 Knowledge Representation and Logic (Propositional Logic) Lesson 12 Propositional Logic inference rules 5.5 Rules of Inference Here are some examples of sound rules of inference. Each can be shown

### Unit 4. Reason as a way of knowing. Tuesday, March 4, 14

Unit 4 Reason as a way of knowing I. Reasoning At its core, reasoning is using what is known as building blocks to create new knowledge I use the words logic and reasoning interchangeably. Technically,

### Relevance. Premises are relevant to the conclusion when the truth of the premises provide some evidence that the conclusion is true

Relevance Premises are relevant to the conclusion when the truth of the premises provide some evidence that the conclusion is true Premises are irrelevant when they do not 1 Non Sequitur Latin for it does

### A R G U M E N T S I N A C T I O N

ARGUMENTS IN ACTION Descriptions: creates a textual/verbal account of what something is, was, or could be (shape, size, colour, etc.) Used to give you or your audience a mental picture of the world around

### 1 Logical Form and Sentential Logic

338 C H A P T E R 1 1 Logical Form and Sentential Logic A bstracting from the content of an argument reveals the logical form of the argument. The initial sections of this chapter show that logical form

What is an argument? PHIL 110 Lecture on Chapter 3 of How to think about weird things An argument is a collection of two or more claims, one of which is the conclusion and the rest of which are the premises.

### Logic: Deductive and Inductive by Carveth Read M.A. CHAPTER IX CHAPTER IX FORMAL CONDITIONS OF MEDIATE INFERENCE

CHAPTER IX CHAPTER IX FORMAL CONDITIONS OF MEDIATE INFERENCE Section 1. A Mediate Inference is a proposition that depends for proof upon two or more other propositions, so connected together by one or

### Announcements. CS311H: Discrete Mathematics. First Order Logic, Rules of Inference. Satisfiability, Validity in FOL. Example.

Announcements CS311H: Discrete Mathematics First Order Logic, Rules of Inference Instructor: Işıl Dillig Homework 1 is due now! Homework 2 is handed out today Homework 2 is due next Wednesday Instructor:

### Informalizing Formal Logic

Informalizing Formal Logic Antonis Kakas Department of Computer Science, University of Cyprus, Cyprus antonis@ucy.ac.cy Abstract. This paper discusses how the basic notions of formal logic can be expressed

### Appendix: The Logic Behind the Inferential Test

Appendix: The Logic Behind the Inferential Test In the Introduction, I stated that the basic underlying problem with forensic doctors is so easy to understand that even a twelve-year-old could understand

### Chapter 1 - Basic Training

Logic: A Brief Introduction Ronald L. Hall, Stetson University Chapter 1 - Basic Training 1.1 Introduction In this logic course, we are going to be relying on some mental muscles that may need some toning

### Testing semantic sequents with truth tables

Testing semantic sequents with truth tables Marianne: Hi. I m Marianne Talbot and in this video we are going to look at testing semantic sequents with truth tables. (Slide 2) This video supplements Session

### Logic -type questions

Logic -type questions [For use in the Philosophy Test and the Philosophy section of the MLAT] One of the questions on a test may take the form of a logic exercise, starting with the definition of a key

### 1 Clarion Logic Notes Chapter 4

1 Clarion Logic Notes Chapter 4 Summary Notes These are summary notes so that you can really listen in class and not spend the entire time copying notes. These notes will not substitute for reading the

### SYLLOGISTIC LOGIC CATEGORICAL PROPOSITIONS

Prof. C. Byrne Dept. of Philosophy SYLLOGISTIC LOGIC Syllogistic logic is the original form in which formal logic was developed; hence it is sometimes also referred to as Aristotelian logic after Aristotle,

### Exercise Sets. KS Philosophical Logic: Modality, Conditionals Vagueness. Dirk Kindermann University of Graz July 2014

Exercise Sets KS Philosophical Logic: Modality, Conditionals Vagueness Dirk Kindermann University of Graz July 2014 1 Exercise Set 1 Propositional and Predicate Logic 1. Use Definition 1.1 (Handout I Propositional

### Complications for Categorical Syllogisms. PHIL 121: Methods of Reasoning February 27, 2013 Instructor:Karin Howe Binghamton University

Complications for Categorical Syllogisms PHIL 121: Methods of Reasoning February 27, 2013 Instructor:Karin Howe Binghamton University Overall Plan First, I will present some problematic propositions and

### What is the Nature of Logic? Judy Pelham Philosophy, York University, Canada July 16, 2013 Pan-Hellenic Logic Symposium Athens, Greece

What is the Nature of Logic? Judy Pelham Philosophy, York University, Canada July 16, 2013 Pan-Hellenic Logic Symposium Athens, Greece Outline of this Talk 1. What is the nature of logic? Some history

### LGCS 199DR: Independent Study in Pragmatics

LGCS 99DR: Independent Study in Pragmatics Jesse Harris & Meredith Landman September 0, 203 Last class, we discussed the difference between semantics and pragmatics: Semantics The study of the literal

### Deccan Education Society s FERGUSSON COLLEGE, PUNE (AUTONOMOUS) SYLLABUS UNDER AUTONOMY FIRST YEAR B.A. LOGIC SEMESTER I

Deccan Education Society s FERGUSSON COLLEGE, PUNE (AUTONOMOUS) SYLLABUS UNDER AUTONOMY FIRST YEAR B.A. LOGIC SEMESTER I Academic Year 2016-2017 Department: PHILOSOPHY Deccan Education Society s FERGUSSON

### ILLOCUTIONARY ORIGINS OF FAMILIAR LOGICAL OPERATORS

ILLOCUTIONARY ORIGINS OF FAMILIAR LOGICAL OPERATORS 1. ACTS OF USING LANGUAGE Illocutionary logic is the logic of speech acts, or language acts. Systems of illocutionary logic have both an ontological,

### UC Berkeley, Philosophy 142, Spring 2016

Logical Consequence UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane 1 Intuitive characterizations of consequence Modal: It is necessary (or apriori) that, if the premises are true, the conclusion

### A short introduction to formal logic

A short introduction to formal logic Dan Hicks v0.3.2, July 20, 2012 Thanks to Tim Pawl and my Fall 2011 Intro to Philosophy students for feedback on earlier versions. My approach to teaching logic has

### This is an electronic version of a paper Journal of Philosophical Logic 43: , 2014.

This is an electronic version of a paper Journal of Philosophical Logic 43: 979-997, 2014. The following passage occurs on p.994 of the published version: The invalidity of Antecedent Strengthening cannot

### 2.3. Failed proofs and counterexamples

2.3. Failed proofs and counterexamples 2.3.0. Overview Derivations can also be used to tell when a claim of entailment does not follow from the principles for conjunction. 2.3.1. When enough is enough

### Part 2 Module 4: Categorical Syllogisms

Part 2 Module 4: Categorical Syllogisms Consider Argument 1 and Argument 2, and select the option that correctly identifies the valid argument(s), if any. Argument 1 All bears are omnivores. All omnivores

### HANDBOOK (New or substantially modified material appears in boxes.)

1 HANDBOOK (New or substantially modified material appears in boxes.) I. ARGUMENT RECOGNITION Important Concepts An argument is a unit of reasoning that attempts to prove that a certain idea is true by

### CRITICAL THINKING (CT) MODEL PART 1 GENERAL CONCEPTS

Fall 2001 ENGLISH 20 Professor Tanaka CRITICAL THINKING (CT) MODEL PART 1 GENERAL CONCEPTS In this first handout, I would like to simply give you the basic outlines of our critical thinking model

### BASIC CONCEPTS OF LOGIC

1 BASIC CONCEPTS OF LOGIC 1. What is Logic?... 2 2. Inferences and Arguments... 2 3. Deductive Logic versus Inductive Logic... 5 4. Statements versus Propositions... 6 5. Form versus Content... 7 6. Preliminary

### b) The meaning of "child" would need to be taken in the sense of age, as most people would find the idea of a young child going to jail as wrong.

Explanation for Question 1 in Quiz 8 by Norva Lo - Tuesday, 18 September 2012, 9:39 AM The following is the solution for Question 1 in Quiz 8: (a) Which term in the argument is being equivocated. (b) What

### 1.5. Argument Forms: Proving Invalidity

18. If inflation heats up, then interest rates will rise. If interest rates rise, then bond prices will decline. Therefore, if inflation heats up, then bond prices will decline. 19. Statistics reveal that

### What would count as Ibn Sīnā (11th century Persia) having first order logic?

1 2 What would count as Ibn Sīnā (11th century Persia) having first order logic? Wilfrid Hodges Herons Brook, Sticklepath, Okehampton March 2012 http://wilfridhodges.co.uk Ibn Sina, 980 1037 3 4 Ibn Sīnā

### GENERAL NOTES ON THIS CLASS

PRACTICAL LOGIC Bryan Rennie GENERAL NOTES ON THE CLASS EXPLANATION OF GRADES AND POINTS, ETC. SAMPLE QUIZZES SCHEDULE OF CLASSES THE SIX RULES OF SYLLOGISMS (and corresponding fallacies) SYMBOLS USED