Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.

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.
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Logic 3 Tautological Implications and Tautological Equivalences
Copyright © Peter Cappello Logical Inferences Goals for propositional logic 1.Introduce notion of a valid argument & rules of inference. 2.Use inference.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
Logical Inferences. De Morgan’s Laws ~(p  q)  (~p  ~q)~(p  q)  (~p  ~q) ~(p  q)  (~p  ~q)~(p  q)  (~p  ~q)
Verifying Arguments MATH 102 Contemporary Math S. Rook.
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
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.
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.
Thinking Mathematically Arguments and Truth Tables.
Do Now. Law of Syllogism ◦ We can draw a conclusion when we are given two true conditional statements. ◦ The conclusion of one statement is the hypothesis.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.4, Slide 1 3 Logic The Study of What’s True or False or Somewhere in Between 3.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
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.
Chapter 1 Logic and proofs
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Copyright © Peter Cappello
Chapter 7. Propositional and Predicate Logic
Logic and Reasoning.
2. The Logic of Compound Statements Summary
Advanced Algorithms Analysis and Design
Discrete Mathematics Lecture 1 Logic of Compound Statements
Knowledge Representation and Reasoning
Discrete Mathematics Logic.
Chapter 1 Logic and Proofs Homework 1 Two merchants publish new marketing campaign to attract more customers. The first merchant launches a motto “Good.
COMP 1380 Discrete Structures I Thompson Rivers University
Rules of Inference Section 1.6.
6.1 Symbols and Translation
Chapter 8 Logic Topics
Fundamentals of Logic Sentence: A sentence is usually collection of words Proposition: A proposition is usually a declarative to which it is meaningful.
2 Chapter Introduction to Logic and Sets
Information Technology Department
7.1 Rules of Implication I Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
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.
Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.
CS 270 Math Foundations of CS
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Inference Rules: Tautologies
The Method of Deduction
Discrete Mathematics Logic.
Conditional Statements
Chapter 7. Propositional and Predicate Logic
Foundations of Discrete Mathematics
COMP 1380 Discrete Structures I Thompson Rivers University
Valid and Invalid Arguments
Mathematical Reasoning
8C Truth Tables, 8D, 8E Implications 8F Valid Arguments
Modus ponens.
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.
3.5 Symbolic Arguments.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the premises. Hence it may be valid inference or faulty inference. Inference is written as (conjunction of premises) → (conclusion) Inference is valid if the implication is tautology otherwise invalid or faulty inference or fallacy Not a Tautology Tautology valid inference invalid inference (faulty)

Rules of Inference – valid: There are 4 fundamental rules Fundamental rule 1: If the statement in P is assumed as True, and the statement P →Q is accepted as true, then we must accept Q as True. (Modus Ponens Rule) Symbolically P P →Q therefore Q Fundamental rule 2: Whenever two implications P →Q and Q →R are accepted as true then we must accept the implication P →R as true (Hypothetical Syllogism or Transitive Rule) Symbolically P →Q Q →R therefore P → R Hypothesis / premises Conclusion Hypothesis / premises Conclusion

Fundamental rule 3: DeMorgan’s Law ~( P V Q ) = ~P ^ ~Q ~( P ^ Q ) = ~P V ~Q Fundamental rule 4: Law of Contra positive P → Q = ~ Q → ~ P

Rules of Inference – Invalid Logical inference is invalid if the implication is not a tautology Also called as faulty inference or fallacy Inference is written as (conjunction of premises) → (conclusion) Tautology Not a Tautology valid inference Invalid inference (faulty)

Rule 1 (Fallacy 1)

The fallacy of denying the antecedent takes the form P →Q ~P therefore ~Q Rule 2 (Fallacy 2) Rule 3 (Fallacy 3)

Exercise Problems: Determine the following arguments are valid or invalid p → q 2. r → s 3. r → s q → r ~s p → q r → s −−−−−− r V p −−−−−− ~r −−−−−− p → s s V q

Determine the following arguments are valid or invalid 4. p → (r → s) 5. ~ r→(s → ~t) 6. p ~r → ~p ~r V w p → q p ~p → s q → r −−−−−−− ~w −−−−−−− s −−−−−−− r t → p

Determine the following arguments are valid or invalid 7. ~p 8 Determine the following arguments are valid or invalid 7. ~p 8. (p Ʌ q) → ~t p → q w V r q → r w → p −−−−−−− r → q ~r −−−−−−−−−−−− (w V r) → ~t

Determine the following arguments are valid or invalid 9 Determine the following arguments are valid or invalid 9. If Tallahassee is not in Florida, then golf balls are not sold in Chicago. Golf balls are not sold in Chicago. Hence, Tallahassee is in Florida. 10. If a baby is hungry, then the baby cries. If the baby is not mad, then he does not cry. If a baby is mad, then he has a red face. Therefore, if a baby is hungry, then he has a red face.

Determine the following arguments are valid or invalid 11. If Nixon is not reelected, then Tulsa will lose it air base. Nixon will be re-elected iff Tulsa will vote for him. If Tulsa keeps its air base, Nixon will be re-elected. Therefore, Nixon will be reelected.

Fill the blanks 12. If today is Thursday, 10days from now will be Monday. Today is Thursday. Hence,________________ 13. If today is Sunday, then I will go to church. ______________________ Therefore, I will go to church.

Fill in the blanks for conformity with transitive rule. 14 Fill in the blanks for conformity with transitive rule. 14. Triangle ABC is equilateral implies triangle ABC is equiangular. Triangle ABC is equiangular implies angle A=60. Hence, _______________________

Determine whether the argument is valid or invalid 15 Determine whether the argument is valid or invalid 15. If today is David’s Birthday, then today is January 24th. Today is January 24th. Hence, today is David’s Birthday

Use a contradiction argument to verify the following valid inferences Use a contradiction argument to verify the following valid inferences. 16. q → t 17. ~p → (q →~w) s → r ~s → q q V s ~t ________ ~p V t t V r _______ w → s

Use contrapositive argument to verify the following valid inference 18 Use contrapositive argument to verify the following valid inference 18. w → (r →s) ____________ (w Ʌ r) → s