Discrete Mathematics Lecture # 8.

Slides:



Advertisements
Similar presentations
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Advertisements

Truth Functional Logic
3.5 – Analyzing Arguments with Euler Diagrams
Valid arguments A valid argument has the following property:
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
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.
CS128 – Discrete Mathematics for Computer Science
TR1413: INTRO TO DISCRETE MATHEMATICS LECTURE 2: MATHEMATICAL INDUCTION.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Adapted from Discrete Math
1.5 Rules of Inference.
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
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.
Valid and Invalid Arguments
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Thinking Mathematically
Thinking Mathematically Arguments and Truth Tables.
Aim: Invalid Arguments Course: Math Literacy Do Now: Aim: What’s an Invalid Argument? Construct a truth table to show the following argument is not valid.
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.
Methods of Proof – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Methods of Proof Reading: Kolman, Section 2.3.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Chapter 1 Propositional Logic
Discrete Mathematical
2. The Logic of Compound Statements Summary
DISCRETE MATHEMATICS CHAPTER I.
Lecture Notes 8 CS1502.
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
Thinking Mathematically
Truth Tables and Equivalent Statements
COMP 1380 Discrete Structures I Thompson Rivers University
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Discrete Mathematics Lecture # 2.
Rules of Inference Section 1.6.
Logic – Bell Ringer.
Evaluating truth tables
Argument Lecture 5.
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.
Natural Deduction.
TRUTH TABLES.
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
TRUTH TABLES continued.
Discrete Mathematics Dr.-Ing. Erwin Sitompul
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Logic.
Discrete Mathematics Lecture # 3.
Conditional Statements
COMP 1380 Discrete Structures I Thompson Rivers University
6.4 Truth Tables for Arguments
Valid and Invalid Arguments
Mathematical Reasoning
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
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.
Presentation transcript:

Discrete Mathematics Lecture # 8

Example An interesting teacher keeps me awake. I stay awake in Discrete Mathematics class. Therefore, my Discrete Mathematics teacher is interesting. Is the above argument valid?

Argument An argument is a list of statements called premises (or assumptions or hypotheses) followed by a statement called the conclusion. P1 Premise P2 Premise P3 Premise . . . . .. . . . . Pn Premise ______________ C Conclusion

Valid Argument An argument is valid if the conclusion is true when all the premises are true. Alternatively, an argument is valid if conjunction of its premises imply conclusion. (P1 P2  P3  . . .  Pn)  C is a tautology.

Invalid Argument An argument is invalid if the conclusion is false when all the premises are true. Alternatively, an argument is invalid if conjunction of its premises does not imply conclusion.

Example Show that the following argument form is valid: pq P q

Solution

Example Show that the following argument form is invalid: pq q p

Solution

Exercise Use truth table to determine the argument form p  q p  ~q p  r r is valid or invalid.

Solution

Exercise If Tariq is not on team A, then Hameed is on team B. If Hameed is not on team B, then Tariq is on team A. Therefore, Tariq is not on team A or Hameed is not on team B.

Solution Let t = Tariq is on team A h = Hameed is on team B Then the argument is ~ t  h ~ h  t  ~ t  ~ h

Solution T H ~T  H ~H  T ~T ~H F

Exercise If at least one of these two numbers is divisible by 6, then the product of these two numbers is divisible by 6. Neither of these two numbers is divisible by 6.  The product of these two numbers is not divisible by 6.

Solution Let d = at least one of these two numbers is divisible by 6. p = product of these two numbers is divisible by 6. Then the argument become in these symbols d  p ~ d  ~ p

solution D P D  P ~D ~P T F

Exercise If I got an Eid bonus, I’ll buy a stereo. If I sell my motorcycle, I’ll buy a stereo.  If I get an Eid bonus or I sell my motorcycle, then I’ll buy a stereo. SOLUTION: Let e = I got an Eid bonus s = I’ll buy a stereo m = I sell my motorcycle The argument is e  s m  s e  m  s

Solution e s m e s m s em em s T F

Example An interesting teacher keeps me awake. I stay awake in Discrete Mathematics class. Therefore, my Discrete Mathematics teacher is interesting.

Solution t: my teacher is interesting a: I stay awake m: I am in Discrete Mathematics class The argument to be tested is t  a, a  m Therefore m  t

Solution t a m t  a a  m m  t T F The argument is not valid