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

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

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.

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

Today s Lecture 2/9/10. Symbolizations continued Chapter 7.2: Truth conditions for our logical operators

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

THE LOGIC OF COMPOUND STATEMENTS

A Quick Lesson on Negation

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

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Fall

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

Deductive and Inductive Logic

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

The Logic of Compound Statements cont.

Section 1.2: Propositional Logic

PROPOSITIONAL CALCULUS

Math 3336: Discrete Mathematics Practice Problems for Exam I

Four Basic Logical Connectives & Symbolization

Rules Build Arguments Rules Building Arguments

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

- a reversed conditional; if a conditional is p q, than its converse is q p

COMP Intro to Logic for Computer Scientists. Lecture 6

Analyzing Arguments with Truth Tables

Manual of Logical Style (fresh version 2018)

3 The Semantics of the Propositional Calculus

(Refer Slide Time: 02:20)

Formal Logic. Critical Thinking

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

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

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

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

DERIVATIONS AND TRUTH TABLES

ICS141: Discrete Mathematics for Computer Science I

Inference and Proofs (1.6 & 1.7)

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

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

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

Predicate Logic & Quantification

Manual of Logical Style

Propositional Logic. Spring Propositional Logic Spring / 32

Announcements. Exam 1 Review

PHI Propositional Logic Lecture 2. Truth Tables

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

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

Proof Worksheet 2, Math 187 Fall 2017 (with solutions)

15414/614 Optional Lecture 1: Propositional Logic

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

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

Last Time. Inference Rules

A. Propositional Logic

Proof strategies, or, a manual of logical style

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

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

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

Where are my glasses?

Chapter 1 Elementary Logic

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

In this chapter, we specify a deductive apparatus for PL.

PHIL012. SYMBOLIC LOGIC PROPOSITIONAL LOGIC DERIVATIONS

Section 1.3: Valid and Invalid Arguments

DEDUCTIVE REASONING Propositional Logic

ECOM Discrete Mathematics

Answers to the Exercises -- Chapter 1

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

INTRODUCTION. Tomoya Sato. Department of Philosophy University of California, San Diego. Phil120: Symbolic Logic Summer 2014

1.1 Statements and Compound Statements

Chapter 3. The Logic of Quantified Statements

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

MATH 22 INFERENCE & QUANTIFICATION. Lecture F: 9/18/2003

PSU MATH RELAYS LOGIC & SET THEORY 2017

8. Reductio ad absurdum

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

Intermediate Logic. Natural Deduction for TFL

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

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

Resolution (14A) Young W. Lim 8/15/14

03 Propositional Logic II

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

10 LOGIC Introduction. Objectives

[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics

Supplementary Logic Notes CSE 321 Winter 2009

8. Reductio ad absurdum

4 Derivations in the Propositional Calculus

Propositional Logic. Fall () Propositional Logic Fall / 30

Lecture 5 : Proofs DRAFT

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

CMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013

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

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

CS 2336 Discrete Mathematics

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Readings: Conjecture. Theorem. Rosen Section 1.5

Discrete Mathematics for CS Spring 2006 Forbes HW 1 Solutions

Section 1.1 Propositions

Self-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein

Logic for Computer Science - Week 5 Natural Deduction

a. ~p : if p is T, then ~p is F, and vice versa

CHAPTER 11. Introduction to Intuitionistic Logic

CPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements

Axiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system:

Transcription:

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

Announcements Homework: --Read Chapter 7 pp. 277-298 (doing the problems in parts A, B, and C pp. 298-300 are recommended but not required at this point). Quiz this Thursday (the 28th): --Be ready to state (i.e. write out) from memory the five famous valid forms. The Text: (e-book option); library reserve Adding the Course

Answers to HW Ex 1.1 Part A (odds) 1. Statement 23. Neither 3. Sentence only 25. Sentence only 5. Statement 27. Sentence only 7. Neither 29. Neither 9. Neither 11. Statement 13. Statement 15. Sentence only 17. Statement 19. Statement 21. Neither

Answers to HW Ex 1.1 Part C (odds) 1. Valid 3. Invalid 5. Valid 7. Invalid 9. Invalid 11. Invalid 13. Invalid 15. Valid

Answers All birds are animals. No tree is a bird. So, no tree is an animal. Key: don t concern yourself with the content of the argument i.e. the actual meaning of the terms bird, animal, and tree Invalid. It doesn't follow absolutely that no tree is an animal. I.e. it's possible for a tree to be an animal given the truth of the premises. We grant that any tree is not a bird (prem 2), and that any bird is an animal (prem 1). But it's still possible that there are other kinds of animals (besides birds) that a tree can be.

Answers All animals are living things. At least one cabbage is a living thing. So at least one cabbage is an animal. Invalid. Assume that if something is an animal, then it s a living thing (prem 1). It doesn t follow that if something is a living thing, then it s an animal. So assuming that at least one cabbage is a living thing (prem 2), it doesn t follow that at least one cabbage is an animal.

Form and Content The content of an argument is its subject matter (what the argument is about) The form of an argument is its underlying pattern of inference.

Identifying the Form The form of an argument can be identified by uniformly replacing the component statements with upper case letters while leaving the logical words intact. The logical words that concern us for now are: 'it's not the case' (or 'not'), 'if, then', 'or, therefore (or so ).

Q: why do we want to be able to recognize an argument s form, particularly if it is a famous valid form? -- such recognition is essential to translating English arguments into logical symbols. -- the five valid forms are also important inference rules for constructing logical proofs.

5 Famous Valid Forms Modus ponens Modus tollens Hypothetical syllogism Disjunctive syllogism Constructive dilemma

Modus Ponens (MP) If Bob is a philosopher, then he is neurotic Bob is a philosopher Therefore, he is neurotic If today is Tuesday, then tomorrow is Wednesday Today is Tuesday Therefore, tomorrow is Wednesday. Though these arguments have different content, they both share the same argument form. That form is: If A, then B A Therefore, B

Modus Ponens Continued If Bob is a philosopher, then Bob is neurotic Bob is a philosopher Therefore, Bob is neurotic The form is: If A, then B A Therefore, B A and B stand for the the argument s component statements.

Modus Tollens (MT) If Bob is a philosopher, then Bob is neurotic It's not the case that Bob is neurotic Therefore, Bob is not a philosopher. If today is Tuesday, then tomorrow is Wednesday Tomorrow is not Wednesday Therefore, today is not Tuesday. Both arguments, though about different things, have the same form: If A, then B Not B Therefore, not A

Hypothetical Syllogism (HS) If an apple is red, then something is red. If something is red, then something is colored. So, if an apple is red, then something is colored. If the universe is 15 billion years old, then the universe is a finite age. If the universe is a finite age, then there was a first moment of time. So, if the universe is 15 billion years old, then there was a first moment of time. Both arguments have the following form: If P, then Q If Q, then R So, if P then R

Disjunctive Syllogism (DS) Either cats are canines or the ocean is green It's not the case that cats are canines So, the ocean is green. Q: What is the form of this argument?

Disjunctive Syllogism (DS) Either cats are canines or the ocean is green It's not the case that cats are canines So, the ocean is green. The form: A or B Not A So, B The following is also a version of (DS): A or B Not B So, A

Constructive Dilemma (CD) 1. Either cats are canines or the ocean is green 2. If cats are canines, then cats have four pointed teeth 3. If the ocean is green, then the ocean is colored 4. So, either cats have four pointed teeth or the ocean is colored Q: What is the form?

Constructive Dilemma (CD) 1. Either cats are canines or the ocean is green 2. If cats are canines, then cats have four pointed teeth 3. If the ocean is green, then the ocean is colored 4. So, either cats have four pointed teeth or the ocean is colored The form: A or B If A, then C If B, then D So, C or D

Some Terminology There is an indefinite number of substitution instances of any argument form. A substitution instance of an argument form is an argument that results from uniformly replacing the variables in that form with statements. A valid argument form is one in which every substitution instance is a valid argument.

Some Exercises P. 29 Part B #s 1,2,4,6,8,10. Assignment: Identify the form; if it is a famous valid form, name which one it is.

# 1 If A, then B A Therefore, B MP

# 2 If A, then B Not B So, Not A MT

# 4 if A, then B B Therefore, A (Note: this is an invalid argument form. Some substitution instances of this form are invalid arguments).

# 6 A or B Not A Therefore, B DS

#8 A or B If A, then C If B, then D So, C or D CD

# 10 If A, then B If B, then C So, If A, then C HS

A Few More Exercises Part C: Pages 30-31. #s 2,7,11,15

#2 Not A If B, then A So, Not B MT

#7 If A, then B If B, then C So, if A, then C HS

#11 Not A A or B So, B DS

#15 If A, then B Not A Not B (Note: this is an invalid argument form. It s possible to have a substitution instance that is an invalid argument)