A Quick Lesson on Negation

Similar documents
2. The Logic of Compound Statements Summary. Aaron Tan August 2017

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

PHI Propositional Logic Lecture 2. Truth Tables

The Logic of Compound Statements cont.

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

PROPOSITIONAL CALCULUS

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

Deductive and Inductive Logic

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Chapter 1: The Logic of Compound Statements. January 7, 2008

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

Logic is the anatomy of thought. John Locke

THE LOGIC OF COMPOUND STATEMENTS

Propositional Logic. Spring Propositional Logic Spring / 32

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Collins' notes on Lemmon's Logic

Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers

Natural deduction for truth-functional logic

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

HANDOUT AND SET THEORY. Ariyadi Wijaya

Section 1.2: Propositional Logic

Logical Form 5 Famous Valid Forms. Today s Lecture 1/26/10

CSC 125 :: Final Exam May 3 & 5, 2010

A Little Deductive Logic

1.1 Statements and Compound Statements

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

Logic for Computer Science - Week 4 Natural Deduction

A Little Deductive Logic

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

15414/614 Optional Lecture 1: Propositional Logic

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Analyzing Arguments with Truth Tables

03 Propositional Logic II

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

Logic is the anatomy of thought. John Locke

DISCRETE MATHEMATICS BA202

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

ICS141: Discrete Mathematics for Computer Science I

A. Propositional Logic

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Predicate Logic & Quantification

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

Chapter 1 Elementary Logic

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Propositional Logic. Fall () Propositional Logic Fall / 30

First-Degree Entailment

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team

CSC Discrete Math I, Spring Propositional Logic

Logical forms and substitution instances. Philosophy and Logic Unit 2, Section 2.1

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC

Propositional Logic Arguments (5A) Young W. Lim 11/30/16

(ÀB Ä (A Â C)) (A Ä ÀC) Á B. This is our sample argument. Formal Proofs

Advanced Topics in LP and FP

Propositional Logic Arguments (5A) Young W. Lim 2/23/17

Math 3336: Discrete Mathematics Practice Problems for Exam I

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

Rules Build Arguments Rules Building Arguments

Formal Logic. Critical Thinking

Chapter 4, Logic using Propositional Calculus Handout

THE LOGIC OF COMPOUND STATEMENTS

Math 1312 Lesson 1: Sets, Statements, and Reasoning. A set is any collection of objects. These objects are called the elements of the set.

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

(p == train arrives late) (q == there are taxis) (r == If p and not q, then r. Not r. p. Therefore, q. Propositional Logic

3 The Semantics of the Propositional Calculus

Manual of Logical Style (fresh version 2018)

Manual of Logical Style

Math.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference

CSC 125 :: Final Exam December 14, 2011

Review The Conditional Logical symbols Argument forms. Logic 5: Material Implication and Argument Forms Jan. 28, 2014

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

Readings: Conjecture. Theorem. Rosen Section 1.5

DISCRETE MATH: LECTURE 3

For a horseshoe statement, having the matching p (left side) gives you the q (right side) by itself. It does NOT work with matching q s.

DEDUCTIVE REASONING Propositional Logic

How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.

1.1 Language and Logic

DERIVATIONS AND TRUTH TABLES

5. And. 5.1 The conjunction

Logic Overview, I. and T T T T F F F T F F F F

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional

It rains now. (true) The followings are not propositions.

CS 2336 Discrete Mathematics

(Refer Slide Time: 02:20)

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

Introduction to Metalogic

Rules of Inference. Arguments and Validity

PHIL012. SYMBOLIC LOGIC PROPOSITIONAL LOGIC DERIVATIONS

Warm-Up Problem. Write a Resolution Proof for. Res 1/32

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Transcription:

A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which logicians call a negation. A negation is a statement that uses the word not (or sometimes no ) to deny another statement. Consider the following statements: A. February is one of the summer months. B. It seems likely that there will be a tornado tomorrow. C. There are more than thirty students in this class. By adding not to each of these statements, we negate (deny, declare to be false, declare the logical opposite of) them, and the statements we generate are negations of A-C: Not-A. February is not one of the summer months. Not-B. It does not seem likely that there will be a tornado tomorrow. Not-C. There aren t more than thirty students in this class. Note, though, that you can negate a statement that already has a not (or no ) in it. Take D-F, each of which is itself a negation of another statement: D. It is not possible to attend two classes at one time. E. Not a single person in this room has climbed Mount Everest. F. She didn t mean to offend someone. If we negate D-F, we get what we call double negations: Not-D. It is not not possible to attend two classes at one time. Not-E. Not not a single person in this room has climbed Mount Everest. Not-F. She didn t not mean to offend someone. Just as in ordinary English language, two not s cancel each other out, so we can read these statements as saying: Not-D. It is possible to attend two classes at one time. Not-E. A single person in this room has climbed Mount Everest. Not-F. She did mean to offend someone. Let s look at how double negations work in real arguments. Here s a premise: 1. If you arrived on time, you weren t late. We can substitute the propositions in this argument with letters to look at its form more easily. Let P = you arrived on time (the antecedent of premise 1), and Q = you weren t late (the consequent of premise 1).

Now, let s make a modus tollens (which, recall, has the form If P then Q. Not-Q. Therefore Not-P.). To do so we must deny the consequent. In other words, we must make our second premise the negation of the consequent in premise 1. But in this argument, our consequent happens to already be a negation. That means that when we deny the consequent, we get a double negation: 2. You weren t not late. which is logically equivalent to the same statement with both not s cancelled out: 2. You were late. A modus tollens allows us to infer Not-P: the negation of the antecedent. So our full argument looks like: 1. If you arrived on time, you weren t late. 2. You were late. 3. Therefore you did not arrive on time. For each of these arguments, determine a) whether it is valid or invalid, b) whether it is sound or unsound, and c) what argument form is used, if it is one of the forms we covered in class.. When in doubt, swap out the propositions (phrases that can stand alone as sentences) within the propositions for letters to look at the argument form. The letters in the argument are the names of the following shapes: A B C D E (square) (rhombus) (triangle) (circle) (oval)

I. II. 1. If a shape is a square, then it has four sides 2. A is a square. 3. Therefore A has four sides. 1. If a shape has four sides, then it is a square. 2. B is not a square. 3. Therefore B does not have four sides. III. 1. If a shape is an equilateral triangle, then it has three sides. 2. C has three sides. 3. Therefore C is an equilateral triangle. IV. 1. If a shape does not have three sides, it is not a triangle. 2. D is not a triangle. 3. Therefore D does not have three sides. V. 1. If a shape has sides, then it is not a circle. 2. E doesn t have sides 3. Therefore E is a circle. VI. 1. If a shape has sides, then it is not a circle. 2. D does not have sides. 3. Therefore D is a circle. VII. 1. If a shape has three sides, it is a triangle. 2. If a shape is a triangle, then it has three equal-length sides. 3. If C has three sides, then C has three equal-length sides. VIII. 1. If a shape is not oblong, then it is not an oval. 2. E is an oval. 3. Therefore E is oblong. IX. 1. Either a shape with four sides is a square or it is a rhombus. 2. A is not a rhombus. 3. Therefore A is a square. X. 1. D is a circle or D is an oval. 2. D is an oval. 3. Therefore D is a circle.

Answer Key I. valid, sound, modus ponens 1. If a shape is a square, then it has four sides. TRUE. If P, then Q. 2. A is a square. TRUE. P. 3. Therefore A has four sides. TRUE. Q. I is valid because it has the form of modus ponens, and sound because premises 1 and 2 are both true. II. valid, not sound, modus tollens 1. If a shape has four sides, then it is a square. FALSE. (If s shape has four sides, it could be a rectangle, a rhombus, a trapezoid, and parallelogram ). If P, then Q. 2. B is not a square. TRUE. Not-Q. 3. Therefore B does not have four sides. FALSE. Not-P. II is valid because it has the form of modus tollens, but not sound because premise 1 is false. III. not valid, not sound, affirming the consequent 1. If a shape is an equilateral triangle, then it has three sides. TRUE. If P, then Q. 2. C has three sides. TRUE. Q. 3. Therefore C is an equilateral triangle. FALSE. P. III is not valid because it uses an invalid form. Though both premises are true, it cannot be sound, because to be sound is to be valid and have all true premises; since it is not valid, it cannot be sound. It yields a false conclusion. IV. not valid, not sound, affirming the consequent 1. If a shape does not have three sides, it is not a triangle. TRUE. If P, then Q. 2. D is not a triangle. TRUE. Q. 3. Therefore D does not have three sides. TRUE. P. This is a tricky one. It gives us a true conclusion, but only by chance not by using an argument form that guarantees the truth of the conclusion, as a valid argument form would. Like in III above, both premises are true, but IV cannot be sound because it is not valid. V. Not valid, not sound, denying the antecedent 1. If a shape has sides, then it is not a circle. TRUE. If P then Q. 2. E doesn t have sides. TRUE. Not-P. 3. Therefore E is a circle. FALSE. Not-Q. V is not valid because it uses an invalid form. We can see that it is invalid because the truth of its premises cannot guarantee the truth of the conclusion.

VI. Not valid, not sound, denying the antecedent. 1. If a shape has sides, then it is not a circle. TRUE. If P then Q. 2. D does not have sides. TRUE. Not-P. 3. Therefore D is a circle. TRUE. Not-Q. VI is not valid and not sound, even though it has a true conclusion. Much like in argument IV, the conclusion is true only by chance not because it uses a form of argument that guarantees a true conclusion to follow from true premises. VII. Valid, not sound, hypothetical syllogism 1. If a shape has three sides, it is a triangle. TRUE. If P, then Q. 2. If a shape is a triangle, then it has three equal-length sides. FALSE. (A triangle can also have two equal-length sides, or no equal-length sides at all.) If Q then R. 3. If C has three sides, then C has three equal-length sides. FALSE. If P, then R. VII is valid, but not sound, because its second premise is false. VIII. Valid, sound, modus tollens. 1. If a shape is not oblong, then it is not an oval. TRUE. If P, then Q. 2. E is an oval. TRUE. Not-Q. 3. Therefore E is oblong. TRUE. Not-P. VIII is valid and sound, since it uses a valid form and has all true premises. IX. Valid, not sound, disjunctive syllogism 1. Either a shape with four sides is a square or it is a rhombus. FALSE. (A shape with four sides could also be a rectangle, a trapezoid, etc.) P or Q. 2. A is not a rhombus. - TRUE. Not-Q. 3. Therefore A is a square. - TRUE. P. IX is valid but not sound, because premise 1 is false. X. Not valid, not sound, dysfunctional syllogism 1. D is a circle or D is an oval. TRUE (or at least, there s no reason to think it false). P or Q. 2. D is an oval. FALSE. Q. 3. Therefore D is a circle. TRUE. P. X has a true conclusion, but it doesn t use a valid pattern of reasoning to infer that conclusion. It starts with a disjunction like a disjunctive syllogism, but it does not rule out one option and infer the other by process of elimination. Instead, it makes it seem like D could be both an oval and a circle which contradicts the implication made by premise 1, that D could be either a circle or an oval, but not both.