# 4.1 A problem with semantic demonstrations of validity

Size: px
Start display at page:

Transcription

1 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 is a significant practical difficulty with our semantic method of checking arguments using truth tables (you may have already noted what this practical difficulty is, when you did problems 1e and 2e of chapter 3). Consider the following argument: Alison will go to the party. If Alison will go to the party, then Beatrice will. If Beatrice will go to the party, then Cathy will. If Cathy will go to the party, then Diane will. If Diane will go to the party, then Elizabeth will. If Elizabeth will go to the party, then Fran will. If Fran will go to the party, then Giada will. If Giada will go to the party, then Hilary will. If Hilary will go to the party, then Io will. If Io will go to the party, then Julie will. Julie will go to the party. Most of us will agree that this argument is valid. It has a rather simple form, in which one sentence is related to the previous sentence, so that we can see the conclusion follows from the premises. Without bothering to make a translation key, we can see the argument has the following form. P (P Q) (Q R) (R S) (S T) (T U) (U V) (V W) (W X) (X Y) Y However, if we are going to check this argument, then the truth table will require 1024 rows! This follows directly from our observation that for arguments or sentences composed of n atomic sentences, the truth table will require 2 n rows. This argument contains 10 atomic sentences. A truth table checking its validity must have 2 10 rows, and 43

2 2 10 =1024. Furthermore, it would be trivial to extend the argument for another, say, ten steps, but then the truth table that we make would require more than a million rows! For this reason, and for several others (which become evident later, when we consider more advanced logic), it is very valuable to develop a syntactic proof method. That is, a way to check proofs not using a truth table, but rather using rules of syntax. Here is the idea that we will pursue. A valid argument is an argument such that, necessarily, if the premises are true, then the conclusion is true. We will start just with our premises. We will set aside the conclusion, only to remember it as a goal. Then, we will aim to find a reliable way to introduce another sentence into the argument, with the special property that, if the premises are true, then this single additional sentence to the argument must also be true. If we could find a method to do that, and if after repeated applications of this method we were able to write down our conclusion, then we would know that, necessarily, if our premises are true then the conclusion is true. The idea is more clear when we demonstrate it. The method for introducing new sentences will be called inference rules. We introduce our first inference rules for the conditional. Remember the truth table for the conditional: Ψ ( Ψ) T T T T F F F T T F F T Look at this for a moment. If we have a conditional like (P Q) (looking at the truth table above, remember that this would meant that we let be P and Ψ be Q), do we know whether any other sentence is true? From (Pà Q) alone we do not. Even if (Pà Q) is true, P could be false or Q could be false. But what if we have some additional information? Suppose we have as premises both (P Q) and P. Then, we would know that if those premises were true, Q must be true. We have already checked this with a truth table. premise premise P Q (Pà Q) P Q T T T T T T F F T F F T T F T F F T F F The first row of the truth table is the only row where all of the premises are true; and for it, we find that Q is true. This of course generalizes to any conditional. That is, we have that: 44

3 premise premise Ψ (à Ψ) Ψ T T T T T T F F T F F T T F T F F T F F We now capture this insight not using a truth table, but by introducing a rule. The rule we will write out like this: ( Ψ) Ψ This is a syntactic rule. It is saying that, whenever we have written down a formula in our language that has the shape of the first row (that is, whenever we have a conditional), and whenever we also have written down a formula that has the shape in the second row (that is, whenever we also have written down the antecedent of the conditional), then go ahead whenever you like and write down a formula like that in the third row (the consequent of the conditional). The rule talks about the shape of the formulas, not their meaning. But of course we justified the rule by looking at the meanings. We describe this by saying that the third line is derived from the earlier two lines using the inference rule. This inference rule is old. We are therefore stuck with its well-established, but not very enlightening, name: modus ponens. Thus we say, for the above example, that the third line is derived from the earlier two lines using modus ponens. 4.2 Direct proof We need one more concept: that of a proof. Specifically, we ll start with the most fundamental kind of proof, which is called a direct proof. The idea of a direct proof is: we write down as numbered lines the premises of our argument. Then, after this, we can write down any line that is justified by an application of an inference rule to earlier lines in the proof. When we write down our conclusion, we are done. Let us make a proof of the simple argument above, which has premises (P Q) and P, and conclusion Q. We start by writing down the premises and numbering them. There is a useful bit of notation that we can introduce at this point. It is known as a Fitch bar, named after a logician Frederic Fitch, who developed this technique. We will write a vertical bar to the left, with a horizontal line indicating that the premises are above the line. 45

4 [illustration 1 here. Figure below to be replaced.] 1. (P Q) 2. P It is also helpful to identify where these steps came from. We can do that with a little explanation written out to the right. [illustration 2 here. Figure below to be replaced.] 1. (P Q) premise 2. P premise Now, we are allowed to write down any line that follows from an earlier line using an inference rule. [illustration 3 here. Figure below to be replaced.] 1. (P Q) premise 2. P premise 3. Q And finally we want a reader to understand what rule we used, so we add that into our explanation, identifying the rule and the lines used. [illustration 4 here. Figure below to be replaced.] 1. (P Q) premise 2. P premise 3. Q modus ponens, 1, 2 That is a complete direct proof. Notice a few things. The numbering of each line, and the explanations to the right, are bookkeeping; they are not part of our argument, but rather are used to explain our argument. Always do them, however, since it is hard to understand a proof without them. Also, note that our idea is that the inference rule can be applied to any earlier line, including lines themselves derived using inference rules. It is not just premises to which we can apply an inference rule. Finally, note that we have established that this argument 46

5 must be valid. From the premises, and an inference rule that preserves validity, we have arrived at the conclusion. Necessarily, the conclusion is true, if the premises are true. The long argument that we started the chapter with can now be given a direct proof. 47

6 [illustration 5 here. Figure below to be replaced.] 1. P premise 2. (P Q) premise 3. (Q R) premise 4. (R S) premise 5. (S T) premise 6. (T U) premise 7. (U V) premise 8. (V W) premise 9. (W X) premise 10. (X Y) premise 11. Q modus ponens, 2, R modus ponens, 3, S modus ponens, 4, T modus ponens, 5, U modus ponens, 6, V modus ponens, 7, W modus ponens, 8, X modus ponens, 9, Y modus ponens, 10, 18 From repeated applications of modus ponens, we arrived at the conclusion. If lines 1 through 10 are true, line 19 must be true. The argument is valid. And we completed it with 19 steps, as opposed to writing out 1024 rows of a truth table. We can see now one of the very important features of understanding the difference between syntax and semantics. Our goal is to make the syntax of our language perfectly mirror its semantics. By manipulating symbols, we manage to say something about the world. This is a strange fact, one that underlies one of the deeper possibilities of language, and also ultimately of computers. 4.3 Other inference rules We can now introduce other inference rules. Looking at the truth table for the conditional again, what else do we observe? Many have noted that if the consequent of a conditional is false, and the conditional is true, then the antecedent of the conditional must be false. Written out as a semantic check on arguments, this will be: 48

7 premise premise Ψ ( Ψ) Ψ T T T F F T F F T F F T T F T F F T T T (Remember how we have filled out the truth table. We referred to those truth tables used to define and, and then for each row of this table above, we filled out the values in each column based on that definition.) What we observe from this truth table is that when both ( Ψ) and Ψ are true, then is true. Namely, this can be seen in the last row of the truth table. This rule, like the last, is old, and has a well-established name: modus tollens. We represent it schematically with ( Ψ) Ψ What about negation? If we know a sentence is false, then this fact alone does not tell us about any other sentence. But what if we consider a negated negation sentence? Such a sentence has the following truth table. T F T F We can introduce a rule that takes advantage of this observation. In fact, it is traditional to introduce two rules, and lump them together under a common name. The rules name is double negation. Basically, the rule says we can add or take away two negations any time. Here are the two schemas for the two rules: 49

8 Finally, it is sometimes helpful to be able to repeat a line. Technically, this is an unnecessary rule, but if a proof gets long, we often find it easier to understand the proof if we write a line over again later when we find we need it again. So we introduce the rule repeat. 4.4 An example Here is an example that will make use of all three rules. Consider the following argument: (Q P) ( Q R) R P We want to check this argument, to see if it is valid. To do a direct proof, we number the premises so that we can refer to them when using inference rules. [illustration 6 here. Figure below to be replaced.] 1. (Q P) premise 2. ( Q R) premise 3. R premise And now we apply our inference rules. Sometimes it can be hard to see how to complete a proof. In the worst case, where you are uncertain of how to proceed, you can apply all the rules that you see are applicable, and then assess if you have gotten closer to the conclusion; and repeat this process. Here in any case is a direct proof of the sought conclusion. [illustration 7 here. Figure below to be replaced.] 1. (Q P) premise 2. ( Q R) premise 3. R premise 4. Q modus tollens, 2, 3 5. Q double negation, 4 6. P modus ponens, 1, 5 50

9 Developing skill at completing proofs merely requires practice. You should strive to do as many problems as you can. 4.5 Problems 1. Complete a direct derivation (also called a direct proof ) for each of the following arguments, showing that it is valid. You will need the rules modus ponens, modus tollens, and double negation. a. Premises: Q, ( Q S). Show: S. b. Premises: (S Q), (P S), P. Show: Q. c. Premises: (T P), (Q S), (S T), P. Show: Q. d. Premises: R, P, (P (R Q)). Show: Q. e. Premises: ((R S) Q), Q, ( (R S) V). Show: V. f. Premises: (P (Q R)), (Q R). Show: P. g. Premises: ( (Q R) P), P, Q. Show: R. h. Premises: P, (P R), (P (R Q)). Show: Q. 2. In normal colloquial English, write your own valid argument with at least two premises. Your argument should just be a paragraph (not an ordered list of sentences or anything else that looks like logic). Translate it into propositional logic and use a direct proof to show it is valid. 3. In normal colloquial English, write your own valid argument with at least three premises. Your argument should just be a paragraph (not an ordered list of sentences or anything else that looks like logic). Translate it into propositional logic and use a direct proof to show it is valid. 4. Make your own key to translate into propositional logic the portions of the following argument that are in bold. Using a direct proof, prove that the resulting argument is valid. Inspector Tarski told his assistant, Mr. Carroll, If Wittgenstein had mud on his boots, then he was in the field. Furthermore, if Wittgenstein was in the field, then he is the prime suspect for the murder of Dodgson. Wittgenstein did have mud on his boots. We conclude, Wittgenstein is the prime suspect for the murder of Dodgson. 51

### 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

### 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.

### 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

### 16. Universal derivation

16. Universal derivation 16.1 An example: the Meno In one of Plato s dialogues, the Meno, Socrates uses questions and prompts to direct a young slave boy to see that if we want to make a square that has

### 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

### 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

### Deductive Forms: Elementary Logic By R.A. Neidorf READ ONLINE

Deductive Forms: Elementary Logic By R.A. Neidorf READ ONLINE If you are searching for a book Deductive Forms: Elementary Logic by R.A. Neidorf in pdf format, in that case you come on to the correct website.

### Illustrating Deduction. A Didactic Sequence for Secondary School

Illustrating Deduction. A Didactic Sequence for Secondary School Francisco Saurí Universitat de València. Dpt. de Lògica i Filosofia de la Ciència Cuerpo de Profesores de Secundaria. IES Vilamarxant (España)

### 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

### 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ā

### Chapter 8 - Sentential Truth Tables and Argument Forms

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

### 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

### 1. Introduction Formal deductive logic Overview

1. Introduction 1.1. Formal deductive logic 1.1.0. Overview In this course we will study reasoning, but we will study only certain aspects of reasoning and study them only from one perspective. The special

### 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

### 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

### 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

### 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

### Philosophy 1100: Ethics

Philosophy 1100: Ethics Topic 1 - Course Introduction: 1. What is Philosophy? 2. What is Ethics? 3. Logic a. Truth b. Arguments c. Validity d. Soundness What is Philosophy? The Three Fundamental Questions

### Lecture 4: Deductive Validity

Lecture 4: Deductive Validity Right, I m told we can start. Hello everyone, and hello everyone on the podcast. This week we re going to do deductive validity. Last week we looked at all these things: have

### How Gödelian Ontological Arguments Fail

How Gödelian Ontological Arguments Fail Matthew W. Parker Abstract. Ontological arguments like those of Gödel (1995) and Pruss (2009; 2012) rely on premises that initially seem plausible, but on closer

### Lecture 17:Inference Michael Fourman

Lecture 17:Inference Michael Fourman 2 Is this a valid argument? Assumptions: If the races are fixed or the gambling houses are crooked, then the tourist trade will decline. If the tourist trade declines

### CHAPTER 1 A PROPOSITIONAL THEORY OF ASSERTIVE ILLOCUTIONARY ARGUMENTS OCTOBER 2017

CHAPTER 1 A PROPOSITIONAL THEORY OF ASSERTIVE ILLOCUTIONARY ARGUMENTS OCTOBER 2017 Man possesses the capacity of constructing languages, in which every sense can be expressed, without having an idea how

### 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.

### Conditionals II: no truth conditions?

Conditionals II: no truth conditions? UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane 1 Arguments for the material conditional analysis As Edgington [1] notes, there are some powerful reasons

### 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

### 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

### Introduction to Logic

University of Notre Dame Fall, 2015 Arguments Philosophy is difficult. If questions are easy to decide, they usually don t end up in philosophy The easiest way to proceed on difficult questions is to formulate

### Circumscribing Inconsistency

Circumscribing Inconsistency Philippe Besnard IRISA Campus de Beaulieu F-35042 Rennes Cedex Torsten H. Schaub* Institut fur Informatik Universitat Potsdam, Postfach 60 15 53 D-14415 Potsdam Abstract We

### 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

### 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

### SOME PROBLEMS IN REPRESENTATION OF KNOWLEDGE IN FORMAL LANGUAGES

STUDIES IN LOGIC, GRAMMAR AND RHETORIC 30(43) 2012 University of Bialystok SOME PROBLEMS IN REPRESENTATION OF KNOWLEDGE IN FORMAL LANGUAGES Abstract. In the article we discuss the basic difficulties which

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

Contents 1 Introduction 3 1.1 Deductive and Plausible Reasoning................... 3 1.1.1 Strong Syllogism......................... 3 1.1.2 Weak Syllogism.......................... 4 1.1.3 Transitivity

### 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?

### 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

### Does Deduction really rest on a more secure epistemological footing than Induction?

Does Deduction really rest on a more secure epistemological footing than Induction? We argue that, if deduction is taken to at least include classical logic (CL, henceforth), justifying CL - and thus deduction

### 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,

### Introduction to Logic

University of Notre Dame Spring, 2017 Arguments Philosophy has two main methods for trying to answer questions: analysis and arguments Logic is the the study of arguments An argument is a set of sentences,

### 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.

### Logic for Computer Science - Week 1 Introduction to Informal Logic

Logic for Computer Science - Week 1 Introduction to Informal Logic Ștefan Ciobâcă November 30, 2017 1 Propositions A proposition is a statement that can be true or false. Propositions are sometimes called

### Introducing truth tables. Hello, I m Marianne Talbot and this is the first video in the series supplementing the Formal Logic podcasts.

Introducing truth tables Marianne: Hello, I m Marianne Talbot and this is the first video in the series supplementing the Formal Logic podcasts. Okay, introducing truth tables. (Slide 2) This video supplements

### 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

### 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

### General Philosophy. Dr Peter Millican,, Hertford College. Lecture 4: Two Cartesian Topics

General Philosophy Dr Peter Millican,, Hertford College Lecture 4: Two Cartesian Topics Scepticism, and the Mind 2 Last Time we looked at scepticism about INDUCTION. This Lecture will move on to SCEPTICISM

### 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

### 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

### 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.,

### 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

### 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,

### 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

### 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

### Tautological Necessity and Tautological Validity With Quantifiers

Some sentences containing quantifiers are truth table necessary. Tautological Necessity and Tautological Validity With Quantifiers Mark Criley IWU 25 October 2017 That is, they are forced to be true just

### Philosophy 220. Truth Functional Properties Expressed in terms of Consistency

Philosophy 220 Truth Functional Properties Expressed in terms of Consistency The concepts of truth-functional logic: Truth-functional: Truth Falsity Indeterminacy Entailment Validity Equivalence Consistency

### Ayer and Quine on the a priori

Ayer and Quine on the a priori November 23, 2004 1 The problem of a priori knowledge Ayer s book is a defense of a thoroughgoing empiricism, not only about what is required for a belief to be justified

### 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

### Comments on Truth at A World for Modal Propositions

Comments on Truth at A World for Modal Propositions Christopher Menzel Texas A&M University March 16, 2008 Since Arthur Prior first made us aware of the issue, a lot of philosophical thought has gone into

### In Part I of the ETHICS, Spinoza presents his central

TWO PROBLEMS WITH SPINOZA S ARGUMENT FOR SUBSTANCE MONISM LAURA ANGELINA DELGADO * In Part I of the ETHICS, Spinoza presents his central metaphysical thesis that there is only one substance in the universe.

### 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

### 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:

### 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/19/2011. Concept. Analysis

Analysis Breaking down an idea, concept, theory, etc. into its most basic parts in order to get a better understanding of its structure. This is necessary to evaluate the merits of the claim properly (is

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

TOPIC: You need to be able to: Lecture 2.1 INTRO TO LOGIC/ ARGUMENTS. Recognize an argument when you see one (in media, articles, people s claims). Organize arguments that we read into a proper argument

### On A New Cosmological Argument

On A New Cosmological Argument Richard Gale and Alexander Pruss A New Cosmological Argument, Religious Studies 35, 1999, pp.461 76 present a cosmological argument which they claim is an improvement over

### 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 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

### 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

### 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

### Scott Soames: Understanding Truth

Philosophy and Phenomenological Research Vol. LXV, No. 2, September 2002 Scott Soames: Understanding Truth MAlTHEW MCGRATH Texas A & M University Scott Soames has written a valuable book. It is unmatched

### G.E. Moore A Refutation of Skepticism

G.E. Moore A Refutation of Skepticism The Argument For Skepticism 1. If you do not know that you are not merely a brain in a vat, then you do not even know that you have hands. 2. You do not know that

### 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

### 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

### FREGE AND SEMANTICS. Richard G. HECK, Jr. Brown University

Grazer Philosophische Studien 75 (2007), 27 63. FREGE AND SEMANTICS Richard G. HECK, Jr. Brown University Summary In recent work on Frege, one of the most salient issues has been whether he was prepared

### Ling 98a: The Meaning of Negation (Week 1)

Yimei Xiang yxiang@fas.harvard.edu 17 September 2013 1 What is negation? Negation in two-valued propositional logic Based on your understanding, select out the metaphors that best describe the meaning

### CHAPTER 2 THE LARGER LOGICAL LANDSCAPE NOVEMBER 2017

CHAPTER 2 THE LARGER LOGICAL LANDSCAPE NOVEMBER 2017 1. SOME HISTORICAL REMARKS In the preceding chapter, I developed a simple propositional theory for deductive assertive illocutionary arguments. This

### 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

### 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)

### Argumentation Module: Philosophy Lesson 7 What do we mean by argument? (Two meanings for the word.) A quarrel or a dispute, expressing a difference

1 2 3 4 5 6 Argumentation Module: Philosophy Lesson 7 What do we mean by argument? (Two meanings for the word.) A quarrel or a dispute, expressing a difference of opinion. Often heated. A statement of

### 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

### 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 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

### An Inferentialist Conception of the A Priori. Ralph Wedgwood

An Inferentialist Conception of the A Priori Ralph Wedgwood When philosophers explain the distinction between the a priori and the a posteriori, they usually characterize the a priori negatively, as involving

### What is the Frege/Russell Analysis of Quantification? Scott Soames

What is the Frege/Russell Analysis of Quantification? Scott Soames The Frege-Russell analysis of quantification was a fundamental advance in semantics and philosophical logic. Abstracting away from details

### Natural Deduction for Sentence Logic

Natural Deduction for Sentence Logic Derived Rules and Derivations without Premises We will pursue the obvious strategy of getting the conclusion by constructing a subderivation from the assumption of

### 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

### Class 33: Quine and Ontological Commitment Fisher 59-69

Philosophy 240: Symbolic Logic Fall 2008 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Re HW: Don t copy from key, please! Quine and Quantification I.

### 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

### Denying the Antecedent as a Legitimate Argumentative Strategy: A Dialectical Model

Denying the Antecedent as a Legitimate Argumentative Strategy 219 Denying the Antecedent as a Legitimate Argumentative Strategy: A Dialectical Model DAVID M. GODDEN DOUGLAS WALTON University of Windsor

### 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

### Can A Priori Justified Belief Be Extended Through Deduction? It is often assumed that if one deduces some proposition p from some premises

Can A Priori Justified Belief Be Extended Through Deduction? Introduction It is often assumed that if one deduces some proposition p from some premises which one knows a priori, in a series of individually

### 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 Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Artificial Intelligence Prof. P. Dasgupta Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture- 10 Inference in First Order Logic I had introduced first order

### 3.3. Negations as premises Overview

3.3. Negations as premises 3.3.0. Overview A second group of rules for negation interchanges the roles of an affirmative sentence and its negation. 3.3.1. Indirect proof The basic principles for negation

### All They Know: A Study in Multi-Agent Autoepistemic Reasoning

All They Know: A Study in Multi-Agent Autoepistemic Reasoning PRELIMINARY REPORT Gerhard Lakemeyer Institute of Computer Science III University of Bonn Romerstr. 164 5300 Bonn 1, Germany gerhard@cs.uni-bonn.de

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.

### Tenacious Tortoises: A Formalism for Argument over Rules of Inference

Tenacious Tortoises: A Formalism for Argument over Rules of Inference Peter McBurney and Simon Parsons Department of Computer Science University of Liverpool Liverpool L69 7ZF U.K. P.J.McBurney,S.D.Parsons

### HAVE WE REASON TO DO AS RATIONALITY REQUIRES? A COMMENT ON RAZ

HAVE WE REASON TO DO AS RATIONALITY REQUIRES? A COMMENT ON RAZ BY JOHN BROOME JOURNAL OF ETHICS & SOCIAL PHILOSOPHY SYMPOSIUM I DECEMBER 2005 URL: WWW.JESP.ORG COPYRIGHT JOHN BROOME 2005 HAVE WE REASON

### Philosophy 1100: Introduction to Ethics. Critical Thinking Lecture 2. Background Material for the Exercise on Inference Indicators

Philosophy 1100: Introduction to Ethics Critical Thinking Lecture 2 Background Material for the Exercise on Inference Indicators Inference-Indicators and the Logical Structure of an Argument 1. The Idea

### 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