Logical Inferences. De Morgan’s Laws ~(p  q)  (~p  ~q)~(p  q)  (~p  ~q) ~(p  q)  (~p  ~q)~(p  q)  (~p  ~q)

Slides:



Advertisements
Similar presentations
Rules of Inference Rosen 1.5.
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:
1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.
The Foundations: Logic and Proofs
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Logic 3 Tautological Implications and Tautological Equivalences
Laws of , , and  Excluded middle law Contradiction law P   P  T P   P  F NameLaw Identity laws P  F  P P  T  P Domination laws P  T  T P.
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.
Copyright © Peter Cappello Logical Inferences Goals for propositional logic 1.Introduce notion of a valid argument & rules of inference. 2.Use inference.
Introduction to Logic Logical Form: general rules
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
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?
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
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.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
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
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Discrete Structures (DS)
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.
Aerospace Engineering Laboratory I
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Ch 1.4: Basic Proof Methods I A theorem is a proposition, often of special interest. A proof is a logically valid deduction of a theorem, using axioms,
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
The construction of a formal argument
Syllogisms and Three Types of Hypothetical Syllogisms
1 Propositional Logic: Fundamental Elements for Computer Scientists 0. Motivation for Computer Scientists 1. Propositions and Propositional Variables 2.
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Outline Logic Propositional Logic Well formed formula Truth table
Logic: The Language of Philosophy. What is Logic? Logic is the study of argumentation o In Philosophy, there are no right or wrong opinions, but there.
Today’s Topics Argument forms and rules (review)
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
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.
Deductive Reasoning. Inductive: premise offers support and evidenceInductive: premise offers support and evidence Deductive: premises offers proof that.
Chapter 1 Logic and proofs
Copyright © Peter Cappello
Logic and Reasoning.
2. The Logic of Compound Statements Summary
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
Formal Logic CSC 333.
Methods of proof Section 1.6 & 1.7 Wednesday, June 20, 2018
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
Rules of Inference Section 1.6.
Information Technology Department
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
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 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Inference Rules: Tautologies
Discrete Mathematics Logic.
Foundations of Discrete Mathematics
Mathematical Reasoning
8C Truth Tables, 8D, 8E Implications 8F Valid Arguments
CS201: Data Structures and Discrete Mathematics I
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

Logical Inferences

De Morgan’s Laws ~(p  q)  (~p  ~q)~(p  q)  (~p  ~q) ~(p  q)  (~p  ~q)~(p  q)  (~p  ~q)

The Law of the Contrapositive (p  q)  (~q  ~p)

What is a rule of inference? A rule of inference allows us to specify which conclusions may be inferred from assertions known, assumed, or previously established.A rule of inference allows us to specify which conclusions may be inferred from assertions known, assumed, or previously established. A tautology is a propositional function that is true for all values of the propositional variables (e.g., p  ~p).A tautology is a propositional function that is true for all values of the propositional variables (e.g., p  ~p).

Modus ponens A rule of inference is a tautological implication.A rule of inference is a tautological implication. Modus ponens: ( p  (p  q) )  qModus ponens: ( p  (p  q) )  q

Modus ponens: An example Suppose the following 2 statements are true:Suppose the following 2 statements are true: If it is 11am in Miami then it is 8am in Santa Barbara. It is 11am in Miami. By modus ponens, we infer that it is 8am in Santa Barbara.By modus ponens, we infer that it is 8am in Santa Barbara.

Other rules of inference Other tautological implications include: p  (p  q)p  (p  q) (p  q)  p(p  q)  p [~q  (p  q)]  ~p[~q  (p  q)]  ~p [(p  q)  ~p]  q[(p  q)  ~p]  q [(p  q)  (q  r)]  (p  r) hypothetical syllogism[(p  q)  (q  r)]  (p  r) hypothetical syllogism [(p  q)  (r  s)  (p  r) ]  (q  s)[(p  q)  (r  s)  (p  r) ]  (q  s) [(p  q)  (r  s)  (~q  ~s) ]  (~p  ~r)[(p  q)  (r  s)  (~q  ~s) ]  (~p  ~r)

Memorize & understand De Morgan’s lawsDe Morgan’s laws The law of the contrapositiveThe law of the contrapositive Modus ponensModus ponens Hypothetical syllogismHypothetical syllogism

Common fallacies 3 fallacies are common: Affirming the converse:Affirming the converse: [(p  q)  q]  p If Socrates is a man then Socrates is mortal. Socrates is mortal. Therefore, Socrates is a man.

Common fallacies... Assuming the antecedent:Assuming the antecedent: [(p  q)  ~p]  ~q If Socrates is a man then Socrates is mortal. Socrates is not a man. Therefore, Socrates is not mortal.

Common fallacies... Non sequitur:Non sequitur: p  q Socrates is a man. Therefore, Socrates is mortal. On the other hand (OTOH), this is valid:On the other hand (OTOH), this is valid: If Socrates is a man then Socrates is mortal. Socrates is a man. Therefore, Socrates is mortal. The form of the argument is what counts.The form of the argument is what counts.

Examples of arguments Given an argument whose form isn’t obvious:Given an argument whose form isn’t obvious: Decompose the argument into assertions Connect the assertions according to the argument Check to see that the inferences are valid. Example argument:Example argument: If a baby is hungry then it cries. If a baby is not mad, then it doesn’t cry. If a baby is mad, then it has a red face. Therefore, if a baby is hungry, it has a red face.

Examples of arguments... Assertions:Assertions: h: a baby is hungry c: a baby cries m: a baby is mad r: a baby has a red face Argument:Argument: ((h  c)  (~m  ~c)  (m  r))  (h  r) Valid?

Examples of arguments... Argument:Argument: Gore will be elected iff California votes for him. If California keeps its air base, Gore will be elected. Therefore, Gore will be elected. Assertions:Assertions: g: Gore will be elected c: California votes for Gore b: California keeps its air base Argument: [(g  c)  (b  g)]  g (valid?)Argument: [(g  c)  (b  g)]  g (valid?)

Characters                                                      