Arguments with Quantified Statements

Slides:



Advertisements
Similar presentations
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
Advertisements

1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
CPSC 121: Models of Computation Unit 6 Rewriting Predicate Logic Statements Based on slides by Patrice Belleville and Steve Wolfman.
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
So far we have learned about:
Through the Looking Glass, 1865
Adapted from Discrete Math
Harper Langston New York University Summer 2015
1.5 Rules of Inference.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
Chapter 2 The Logic of Quantified Statements. Section 2.4 Arguments with Quantified Statements.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
Arguments with Quantified Statements M Universal Instantiation If some property is true for everything in a domain, then it is true of any particular.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Question of the Day!  We shared a lot of examples of illogical arguments!  But how do you make a LOGICAL argument? What does your argument need? What.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Philosophical Method  Logic: A Calculus For Good Reason  Clarification, Not Obfuscation  Distinctions and Disambiguation  Examples and Counterexamples.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
GEOMETRIC PROOFS A Keystone Geometry Mini-Unit. Geometric Proofs – An Intro Why do we have to learn “Proofs”? A proof is an argument, a justification,
Copyright © Cengage Learning. All rights reserved.
Dilemma: Division Into Cases Dilemma: p  q p  r q  r  r Premises:x is positive or x is negative. If x is positive, then x 2 is positive. If x is negative,
Discrete Mathematics Lecture 2 Continuing Logic, Quantified Logic, Beginning Proofs Harper Langston New York University Summer 2016.
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Harper Langston New York University Summer 2017
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
Valid and Invalid Arguments
3. The Logic of Quantified Statements Summary
Lecture Notes 8 CS1502.
Formal Logic CSC 333.
COMP 1380 Discrete Structures I Thompson Rivers University
Methods of proof Section 1.6 & 1.7 Wednesday, June 20, 2018
Demonstrating the validity of an argument using syllogisms.
Copyright © Cengage Learning. All rights reserved.
2 Chapter Introduction to Logic and Sets
Proposition logic and argument CISC2100, Spring 2017 X.Zhang
3 Logic The Study of What’s True or False or Somewhere in Between.
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
CS201: Data Structures and Discrete Mathematics I
Mathematical Reasoning
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Hurley … Chapter 6.5 Indirect Truth Tables
Copyright © Cengage Learning. All rights reserved.
Applied Discrete Mathematics Week 1: Logic
Thinking Critically Copyright © 2011 Pearson Education, Inc.
Inference Rules: Tautologies
The Method of Deduction
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
Computer Security: Art and Science, 2nd Edition
1 Chapter An Introduction to Problem Solving
Lesson 5.6 Deductive Proofs pp
Discrete Mathematics Lecture 4 Logic of Quantified Statements
COMP 1380 Discrete Structures I Thompson Rivers University
CPSC 121: Models of Computation
Copyright © Cengage Learning. All rights reserved.
Mathematical Reasoning
Logical and Rule-Based Reasoning Part I
Modus ponens.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
Identifying & Ordering
Presentation transcript:

Arguments with Quantified Statements The rule of universal instantiation says the following: Universal instantiation is the fundamental tool of deductive reasoning. Mathematical formulas, definitions, and theorems are like general templates that are used over and over in a wide variety of particular situations.

Universal Modus Ponens The rule of universal instantiation can be combined with modus ponens to obtain the valid form of argument called universal modus ponens.  

Example – Recognizing the Form of Universal Modus Ponens All human beings are mortal. Jim is a human being.  Jim is mortal.

Universal Modus Tollens Another crucially important rule of inference is universal modus tollens. Its validity results from combining universal instantiation with modus tollens. Universal modus tollens is the heart of proof of contradiction, which is one of the most important methods of mathematical argument.  

Example – Recognizing the Form of Universal Modus Tollens All human beings are mortal. Zeus is not mortal.  Zeus is not human.

Example 6 – Using Diagrams to Show Validity Use a diagram to show the invalidity of the following argument: All human beings are mortal. Jim is a human being.  Jim is mortal. Felix is mortal.  Felix is a human being.

Example 6 – Solution cont’d The conclusion “Felix is a human being” is true in the first case but not in the second (Felix might, for example, be a cat). Because the conclusion does not necessarily follow from the premises, the argument is invalid.

Using Diagrams to Test for Validity This argument would be valid if the major premise were replaced by its converse. But since a universal conditional statement is not logically equivalent to its converse, such a replacement cannot, in general, be made. We say that this argument exhibits the converse error.  

Using Diagrams to Test for Validity The following form of argument would be valid if a conditional statement were logically equivalent to its inverse. But it is not, and the argument form is invalid. We say that it exhibits the inverse error.  

Example 7 – An Argument with “No” Use diagrams to test the following argument for validity: No UNC student works for Duke. Jim works for Duke.  Jim is not a UNC student.

Using Diagrams to Test for Validity An alternative approach to this example is to transform the statement “No UNC student works for Duke.” into the equivalent form “x, if x is a UNC student, then x does not work for Duke.”

Using Diagrams to Test for Validity If this is done, the argument can be seen to have the form where P (x) is “x is a UNC student” and Q (x) is “x does not work for Duke.” Use “Jim” substitute “a”, ~Q (a): Jim works for Duke. This is valid by universal modus tollens. 

Creating Additional Forms of Argument Consider the following argument: This argument form can be combined with universal instantiation to obtain the following valid argument form.   