Tutorial A03: Patterns of Valid Arguments By: Jonathan Chan

Similar documents
Selections from Aristotle s Prior Analytics 41a21 41b5

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.

Chapter 8 - Sentential Truth Tables and Argument Forms

The antecendent always a expresses a sufficient condition for the consequent

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

Logic Book Part 1! by Skylar Ruloff!

A Mini Guide to Critical Thinking. Joe Lau

Introduction to Philosophy

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

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

HOW TO ANALYZE AN ARGUMENT

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

PHI 1500: Major Issues in Philosophy

Logic Appendix: More detailed instruction in deductive logic

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

2. Refutations can be stronger or weaker.

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

Chapter 1. What is Philosophy? Thinking Philosophically About Life

C. Exam #1 comments on difficult spots; if you have questions about this, please let me know. D. Discussion of extra credit opportunities

Philosophy 1100: Ethics

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

Chapter 3: More Deductive Reasoning (Symbolic Logic)

Logic for Computer Science - Week 1 Introduction to Informal Logic

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

Philosophical Arguments

Session 10 INDUCTIVE REASONONING IN THE SCIENCES & EVERYDAY LIFE( PART 1)

Informalizing Formal Logic

Chapter 9- Sentential Proofs

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

Semantic Entailment and Natural Deduction

Introduction to Philosophy

Lecture 2.1 INTRO TO LOGIC/ ARGUMENTS. Recognize an argument when you see one (in media, articles, people s claims).

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

Introducing Our New Faculty

Appendix: The Logic Behind the Inferential Test

Revisiting the Socrates Example

Chapter 1. Introduction. 1.1 Deductive and Plausible Reasoning Strong Syllogism

Logic: A Brief Introduction

What is an argument? PHIL 110. Is this an argument? Is this an argument? What about this? And what about this?

Introduction to Logic

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

Study Guides. Chapter 1 - Basic Training

A short introduction to formal logic

Introduction to Logic

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

Tutorial A02: Validity and Soundness By: Jonathan Chan

PART III - Symbolic Logic Chapter 7 - Sentential Propositions

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

Beyond Symbolic Logic

CHAPTER THREE Philosophical Argument

VERITAS EVANGELICAL SEMINARY

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

Lecture 4 Good and Bad Arguments Jim Pryor Some Good and Bad Forms of Arguments

Chapter 2 Analyzing Arguments

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

Thinking and Reasoning

The Development of Laws of Formal Logic of Aristotle

Is anything knowable on the basis of understanding alone?

Handout 1: Arguments -- the basics because, since, given that, for because Given that Since for Because

The Problem of Induction and Popper s Deductivism

PHLA10F 2. PHLA10F What is Philosophy?

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

Questions for Critically Reading an Argument

INTERMEDIATE LOGIC Glossary of key terms

T. Parent. I shall explain these steps in turn. Let s consider the following passage to illustrate the process:

How Gödelian Ontological Arguments Fail

Overview of Today s Lecture

4.1 A problem with semantic demonstrations of validity

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

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

In view of the fact that IN CLASS LOGIC EXERCISES

St. Anselm s versions of the ontological argument

Criticizing Arguments

Logic -type questions

EPISTEMOLOGY AND MATHEMATICAL REASONING BY JAMES D. NICKEL

Lecture 4: Deductive Validity

Critical Thinking. The Four Big Steps. First example. I. Recognizing Arguments. The Nature of Basics

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

It Ain t What You Prove, It s the Way That You Prove It. a play by Chris Binge

1. To arrive at the truth we have to reason correctly. 2. Logic is the study of correct reasoning. B. DEDUCTIVE AND INDUCTIVE ARGUMENTS

A Brief Introduction to Key Terms

Logic. A Primer with Addendum

Logic, reasoning and fallacies. Example 0: valid reasoning. Decide how to make a random choice. Valid reasoning. Random choice of X, Y, Z, n

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

PHILOSOPHY OF LOGIC AND LANGUAGE OVERVIEW LOGICAL CONSTANTS WEEK 5: MODEL-THEORETIC CONSEQUENCE JONNY MCINTOSH

The Ontological Argument. An A Priori Route to God s Existence?

Skim the Article to Find its Conclusion and Get a Sense of its Structure

IS THE SYLLOGISTIC A LOGIC? it is not a theory or formal ontology, a system concerned with general features of the

Phil. 103: Introduction to Logic The Structure of Arguments

Full file at

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

Phil 3304 Introduction to Logic Dr. David Naugle. Identifying Arguments i

16. Universal derivation

2.1 Review. 2.2 Inference and justifications

5.6.1 Formal validity in categorical deductive arguments

Argument Forms. 1.2 Forms and Validity

Aquinas' Third Way Modalized

Philosophy exit exam (Logic: 1-10; Ancient: 11-20; Modern: 21-30; Ethics: 31-40; M&E: 41-50)

Understanding Truth Scott Soames Précis Philosophy and Phenomenological Research Volume LXV, No. 2, 2002

Comments on Truth at A World for Modal Propositions

Transcription:

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 role in reasoning, because if we start with true assumptions, and use only valid arguments to establish new conclusions, then our conclusions must also be true. But which are the rules we should use to decide whether an argument is valid or not? This is where formal logic comes in. By using special symbols we can describe patterns of valid argument, and formulate rules for evaluating the validity of an argument. A03.2 Modus ponens Consider the following arguments: If this object is made of copper, it will conduct electricity. This object is made of copper, so it will conduct electricity. If there is no largest prime number, then 510511 is not the largest prime number. There is no largest prime number. Therefore 510511 is not the largest prime number. If Lam is a Buddhist then he should not eat pork. Lam is a Buddhist. Therefore Lam should not eat pork. These three arguments are of course valid. Furthermore you probably notice that they are very similar to each other. What is common between them is that they have the same structure or form: Modus ponens - If P then Q. P. Therefore Q. Here, the letters P and Q are called sentence letters. They are used to translate or represent statements. By replacing P and Q with appropriate sentences, we can generate the original three valid arguments. This shows that the three arguments have a common form. It is also in virtue of this form that the arguments are valid, for we can see that any argument of the same form is a valid argument. Because this particular pattern of argument is quite common, it has been given a name. It is known as modus ponens. However, don't confuse modus ponens with the following form of argument, which is not valid! Affirming the consequent - If P then Q. Q. Therefore, P. Note - When we say that this is not a valid pattern of argument, what is meant is that not every argument of this pattern is valid. This is different from saying that every argument of this pattern is not valid. See if you can figure out why this is the case. Giving arguments of this form is a fallacy - making a mistake of reasoning. This particular mistake is known as affirming the consequent.

If Jane lives in London then Jane lives in England. Jane lives in England. Therefore Jane lives in London. [Not valid - perhaps Jane lives in Liverpool.] If Bing has gone shopping then Daniel will be unhappy. Daniel is unhappy. So Bing has gone shopping. [Not valid - perhaps Daniel is unhappy because he has run out of vodka to drink.] There are of course many other patterns of valid argument. Now we shall introduce a few more patterns which are often used in reasoning. A03.3 Modus tollens Modus tollens - If P then Q. Not-Q. Therefore, not-p. Here, "not-q" simply means the denial of Q. So if Q means "Today is hot.", then "not-q" can be used to translate "It is not the case that today is hot", or "Today is not hot." If Betty is on the plane, she will be in the A1 seat. But Betty is not in the A1 seat. So she is not on the plane. But do distinguish modus tollens from the following fallacious pattern of argument : Denying the antecedent - If P then Q, not-p. Therefore, not-q. If Elsie is competent, she will get an important job. But Elsie is not competent. So she will not get an important job. [Not valid : Perhaps Elsie is incompetent but her boss likes her because she accepts very low wages.] A03.4 Hypothetical syllogism If P then Q, If Q then R. Therefore, if P then R. If God created the universe then the universe will be perfect. If the universe is perfect then there will be no evil. So if God created the universe there will be no evil. A03.5 Disjunctive syllogism P or Q. Not-P. Therefore, Q ; P or Q, Not-Q. Therefore, P. Either the government brings about more sensible educational reforms, or the only good schools left will be private ones for rich kids. The government is not going to carry out sensible educational reforms. So the only good schools left will be private ones for rich kids. A03.6 Dilemma

P or Q. If P then R. If Q then S. Therefore, R or S. When R is the same as S, we have a simpler form : P or Q. If P then R. If Q then R. Therefore, R. Either we increase the tax rate or we don't. If we do, the people will be unhappy. If we don't, the people will also be unhappy. (Because the government will not have enough money to provide for public services.) So the people are going to be unhappy anyway. A03.7 Arguing by Reductio ad Absurdum The Latin name here simply means "reduced to absurdity". Here is the method of argument if you want to prove that a certain statement S is false: First assume that S is true. From the assumption that it is true, prove that it would lead to a contradiction or some other claim that is false or absurd. Conclude that S must be false. Those of you who can spot connections quickly might notice that this is none other than an application of modus tollens. A famous application of this pattern of argument is Euclid's proof that there is no largest prime number. A prime number is any positive integer greater than 1 that is wholly divisible only by 1 and by itself, e.g. 2, 3, 5, 7, 11, 13, 17, etc. Assume that there are only n prime numbers, where n is a finite number : P1 < P2 <... < Pn. Define a number Q that is 1 plus the product of all primes, i.e. Q = 1 + ( P1 x P2 x... x Pn). Q is of course larger than Pn. But Q has to be a prime number also, because (a) when it is divided by any prime number it always leave a remainder of 1, and (b) if it is not divisible by an prime number it cannot be divisible by any non-prime numbers either. So Q is a prime number larger than the largest prime number. But this is a contradiction, so the original assumption that there is a finite number of prime numbers must be wrong. So there must be infinitely many primes. Let us look at two more examples of reductio: Suppose someone were to claim that nothing is true or false. We can show that this must be false as follows : If this person's claim is indeed correct, then there is at least one thing that is true, namely the claim that the person is making. So it can't be that nothing is true or false. So his statement must be false. One theory of how the universe came about is that it developed from a vacuum state in the infinite past. Stephen Hawking thinks that this is false. Here is his argument : in order for the universe to develop from a vacuum state, the vacuum state must have been unstable. (If the vacuum state were a stable one, nothing would come out of it.) But if it was unstable, it would not be a vacuum state, and it would not have lasted an infinite time before becoming unstable. A03.8 Other Patterns

There are of course many other patterns of deductively valid arguments. One way to construct more patterns is to combine the ones that we have looked at earlier. For example, we can combine two cases of hypothetical syllogism to obtain the following argument: If P then Q. If Q then R. If R then S. Therefore if P then S. There are also a few other simple but also valid patterns which we have not mentioned: P and Q. Therefore Q. P. Therefore P. Some of you might be surprised to find out that "P. Therefore P." is valid. But think about it carefully - if the conclusion is also a premise, then the conclusion obviously follows from the premise! Of course, this tells us that not all valid arguments are good arguments. How these two concepts are connected is a topic we shall discuss later on. We shall look at a few more complicated patterns of valid arguments in another tutorial. It is understandable that you might not remember all the names of these patterns. But what is important is that you can recognize these argument patterns when you come across them in everyday life, and would not confuse them with patterns of invalid arguments that look similar. A03.9 Exercises Question 1 Consider the following arguments. Identify the forms of all valid arguments. Q1.1. If Jesus loves me, then I love Jesus. I do not love Jesus. Therefore, Jesus does not love me. Q1.2. Either Jimmy is walking the dog or Cathy is feeding the cat (or both). Cathy is feeding the cat. Therefore Jimmy is not walking the dog Q1.3. Either Jimmy is walking the dog or Cathy is feeding the cat. Cathy is not feeding the cat. Therefore Jimmy is walking the dog. Q1.4. If X is a man, then X is a human being. If X is a human being, then X is an animal. Therefore, if X is a man, then X is an animal. Q1.5. If I do not have Yellow Tail sashimi, then I shall have scallop sushi instead. Now, I have Yellow Tail sashimi. So I do not have scallop sushi. Q1.6. If some sheep are black, then some ducks are pink. It is not true that some ducks are pink. Therefore, it is not true that some sheep are black.

Q1.7. Either she is right or she is wrong. If she is right, then he is wrong. If she is wrong, then he is also wrong. Therefore, he is wrong either way. Q1.8. Paul is a bachelor. Paul is single. So at least one bachelor is single. Q1.9. Either she is in China or she is in Europe. If she is in China, then she is in Beijing. If she is in Europe, then she is sleeping. Hence, either she is in Beijing or she is sleeping. Question 2 Identify the conclusions that can be drawn from these assumptions. Which basic patterns of valid arguments should be used to derive the conclusion? If God is perfect, then God knows what people intend to do in the future. If God knows what people intend to do in the future, then God can stop people from bringing about evil. If he is dead, then there will be no pulse. If there is no pulse, then the red light will turn on. There is no red light. Either Krypto is hot or Pluto is hot. If Krypto is hot, then there is no ice on its surface. But there is. Either you speak justly or unjustly. If you speak justly then men will hate you. But if you speak unjustly the gods will hate you. Johannes is either in Hong Kong or in Thailand. He is not at home. If he is in Thailand he is staying at the Peninsula. If he is in Hong Kong he is at home. Question 3 If the following statements are all true, who killed Pam and where was Jones in 1997? Which piece of information is not needed? Jones was either in HK or in London in 1997. If Jones did not kill Pam, then Peter did. If Pam died of suffocation, then either Jones killed her, or Pam committed suicide. If Jones was in HK in 1997, then Jones did not kill Pam. Pam died of suffocation but she did not kill herself. Question 4 Suppose someone thinks that there is only a finite number of integers. How would he criticize the proof that there are infinitely many primes? Which step would he reject? Question 5 Here is a very nice example taken from the philosopher James Pryor: A computer scientist announces that he's constructed a computer program that can play the perfect game of chess: he claims that this program is guaranteed to win every game it plays, whether it plays black or white, with never a loss or a draw, and against any opponent whatsoever. The computer scientist claims to have a mathematical proof that his program will always win, but the proof runs to 500 pages of dense mathematical symbols, and no one has yet been able to verify it. Still, the program has just played 20 games against Gary Kasparov and it won every game, 10 as white and 10 as black. Should you believe the computer scientist's claim that the program is so designed that it will always win against every opponent? How would you use the reduction method to argue against the computer scientist?

What if two computers running the same program were to play against each other?