IX Conjunctions of Premises & Conclusions Working with more than two premises.

Slides:



Advertisements
Similar presentations
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Advertisements

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Necessary & Sufficient Conditions Law, Science, Life & Logic.
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
Introduction to Theorem Proving
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.
1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
CS128 – Discrete Mathematics for Computer Science
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.
Logic 3 Tautological Implications and Tautological Equivalences
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Knoweldge Representation & Reasoning
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Discrete Mathematics and its Applications
Critical Thinking: A User’s Manual
Adapted from Discrete Math
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
Copyright © Curt Hill Rules of Inference What is a valid argument?
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Propositional Proofs 2.
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 10 Logic Section 10.1 Statements Section 10.2 Conditional Statements Section.
Modus Ponens The following valid arguments show us how to apply the modus ponens (Rule of Detachment). a) 1) Lydia wins a ten-million-dollar lottery.
March 3, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1Arguments Just like a rule of inference, an argument consists of one or more.
Proofs1 Elementary Discrete Mathematics Jim Skon.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Arguments with Quantified Statements M Universal Instantiation If some property is true for everything in a domain, then it is true of any particular.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
Philosophical Method  Logic: A Calculus For Good Reason  Clarification, Not Obfuscation  Distinctions and Disambiguation  Examples and Counterexamples.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Methods of Proof – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Methods of Proof Reading: Kolman, Section 2.3.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
Chapter 1 Logic and proofs
Arguments with Quantified Statements
2. The Logic of Compound Statements Summary
Proof Techniques.
2 Chapter Introduction to Logic and Sets
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
CS201: Data Structures and Discrete Mathematics I
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
CS 270 Math Foundations of CS
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Discrete Mathematics Lecture # 8.
1 Chapter An Introduction to Problem Solving
Computer Security: Art and Science, 2nd Edition
1 Chapter An Introduction to Problem Solving
Foundations of Discrete Mathematics
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Presentation transcript:

IX Conjunctions of Premises & Conclusions Working with more than two premises

Proving arguments with several premises To show the validity of these arguments, it is necessary to do the proof in several steps A reason must be given for each step taken in a proof like the Theorems of Logic (find those notes!)

Additional Rules The conjunction of two premises follows from the premises. The conjunction of a premise and the conclusion of a valid argument follows. The conjunction of two conclusions of valid arguments follows from the premises.

Thought Process When checking the validity of an argument, carefully list each step and give the reason that the step can be taken If an argument cannot be proven to be valid, it should be shown to be invalid. This can be done by showing that (hypothesis)  (conclusion) is not a tautology. It is sufficient to show that there is at least one case where (hypothesis)  (conclusion) has a truth value of false

Example: Check the validity of the following argument If it is raining, then the picnic is cancelled. If it is not raining, then the soccer game is not delayed. But the picnic is not cancelled. Therefore the soccer game is not delayed. Let r denote “It is raining.” Let p denote “The picnic is cancelled.” Let s denote “The soccer game is delayed.”

Write in symbolic form FIRST! P1: r  p P2:  r   s P3:  p. C:  s If it is raining, then the picnic is cancelled. If it is not raining, then the soccer game is not delayed. But the picnic is not cancelled. Therefore the soccer game is not delayed. Let r denote “It is raining.” Let p denote “The picnic is cancelled.” Let s denote “The soccer game is delayed.”

Now to prove – i.e write reasons why each step can be taken 1. r  p P remise (this is given) 2.  r   sPremise (given) 3.  pPremise (given) 4. (r  p)   p Conjunction of premises 1 and 3 5.  r Rule of Modus Tollens applied to step 4 6. (  r   s)   r Conjunction of premise 2 and valid argument 5 7.  s Rule of Modus Ponens applied to step 6

Lets try another If an object is less dense than water (l), it will float (f). The water displaced by an object will weigh more than the object (m), or the object will not float. But, the water displaced by the object does not weigh more than the object. Thus, the object is not less dense than water.

Write it in symbolic form first P1: l  f P2: m   f P3:  m. C:  l If an object is less dense than water (l), it will float (f). The water displaced by an object will weigh more than the object (m), or the object will not float. But, the water displaced by the object does not weigh more than the object. Thus, the object is not less dense than water.

Now to Prove! 1. l  f Premise 2. m   fPremise 3.  mPremise 4.  f  mCommutative Property applied to step 2 5. f  mProperty of Logical Equivalence 6. (f  m)   m Conjunction of valid argument 5 and premise 3 7.  fRule of Modus Tollens 8. ( l  f)   f Conjunction of premise 1 and valid argument 7 9.  lRule of Modus Tollens

How About an Invalid One If the sun has set (s), then the street lamps are on (l). Either the electrical circuits are working (e), or the street lamps are not on. The electrical circuits are not working. Therefore, the sun has set

Symbolic form first P1: s  l P2: e   l P3:  e. C: s If the sun has set (s), then the street lamps are on (l). Either the electrical circuits are working (e), or the street lamps are not on. The electrical circuits are not working. Therefore, the sun has set

A different approach since invalid Must use a truth table to show invalid So how do we do that??? (hypothesis)  (conclusion) must be a tautology for a valid argument.

Make a truth table [(s  l)  (e   l)   e]  s

HOMEWORK 6 Rewrite using symbolic form, then check the validity of the argument 1.The space shuttle landed in Florida (f) or it landed in California (o). If the space shuttle landed in California, then the alternate landing schedule was used (a). But, the alternate landing schedule was not used. Therefore, the space shuttle landed in Florida. 1.If February has 29 days (d), then it is a leap year (l). If it is a leap year, then there will be a presidential election (e). But, there is not a presidential election. Therefore, February does not have 29 days.