CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
More on Conditionals Section 1.4. Introduction Given a conditional of the form “if p then q” p  q, we can then form 3 other forms of the conditional.
What is the hypothesis in the sentence “I go swimming if the sun is out and the temperature is over 80.” 1.I go swimming 2. the sun is out 3.the temperature.
Adapted from Discrete Math
More on Conditionals. Objectives Write the converse, inverse, and contrapositive of a given conditional statement. Determine the premise and conclusion.
Propositions and Truth Tables
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Propositions and Truth Tables. Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
Thinking Mathematically Logic 3.5 Equivalent Statements and Variation of Conditional Statements.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
Thinking Mathematically Equivalent Statements, Conditional Statements, and De Morgan’s Laws.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
MADAM SITI AISYAH ZAKARIA. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC LOGICAL CONNECTIVES CONDITIONAL STATEMENT.
 Outside across from the word: › write the symbol for conditional: p -> q  INSIDE: › How to write the statement : If p, then q. › Example : If an angle.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
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.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Law of logic Lecture 4.
Simple Logic.
Chapter 1 – Part 3 ELEMENTARY LOGIC
Chapter 1 Propositional Logic
1.8 Statements of LOGIC Conditional Statement Form “If……then…….”
2. The Logic of Compound Statements Summary
Conditional Statements
Conditional Statements
CSNB 143 Discrete Mathematical Structures
Distributive Property
Chapter 1 – Logic and Proof
Logic.
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
MATH 245 Spring 2009 This is mathematics for computer science
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
Biconditional - 2 CS-708.
(CSC 102) Discrete Structures Lecture 2.
Warm Up:.
Equivalent Statements and Variations of Conditional Statements
Mathematics for Computing
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
Information Technology Department
CS 220: Discrete Structures and their Applications
CS201: Data Structures and Discrete Mathematics I
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Copyright © Cengage Learning. All rights reserved.
(1.4) An Introduction to Logic
1 Chapter An Introduction to Problem Solving
Discrete Mathematics and Its Applications Kenneth H
1 Chapter An Introduction to Problem Solving
Equivalent Statements
Discrete Mathematics Lecture # 3.
Symbolic Logic 2/25/2019 rd.
MAT 3100 Introduction to Proof
Equivalent Statements
Do Now:.
CHAPTER 3 Logic.
Logic and Reasoning.
Discrete Structures Prepositional Logic 2
Conditional Statements Section 2.3 GEOMETRY
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

CS-7081 Application - 1

CS-7082 Example - 2

CS-7083 Simplifying a Statement – 3

CS-7084 Distributive Law in Reverse – 4

CS-7085 Exercise – 5

CS-7086 Exercise - 5a

CS-7087 Conditional Statements - 6

CS-7088 Conditional Statements – 6a

CS-7089 Truth Table for p  q - 8

CS Conditional Statements or Implications - 7

CS Conditional Statements OR Implications – 7a

CS Example – 9

CS Alternative Ways of Expressing Implications – 10

CS Alternative Ways of Expressing Implications – 10a

CS Exercise - 11

CS Exercise – 11a

CS Translating English Sentences to Symbols - 12

CS Translating English Sentences to Symbols – 12a

CS Translating English Sentences to Symbols – 12b

CS Translating English Sentences to Symbols – (3 – 12c)

CS Translating Symbolic Propositions to English – 13

CS Translating Symbolic Propositions to English – 13a

CS Translating Symbolic Propositions to English – 13b

CS Hierarchy of Operations for Logical Connectives - 14

CS Truth Table for p v ~ q  ~ p – 20a

CS Truth Table for p v ~ q  ~ p – 20b

CS (p  q) (~p  r) - 21

CS (p  q) (~p  r) – 21a

CS (p  q) (~p  r) – 21c

CS p  q ≡ ~q  ~p- 22

CS Implication Law – 23

CS Negation of a Conditional Statement - 15

CS Examples – (3 - 16)

CS Example – 16a

CS Inverse of a Conditional Statement - 24

CS p  q is not equivalent to ~p  ~q – (3 – 25)

CS Writing Inverse – 17

CS Writing Inverse – 17a

CS Converse of a Conditional Statement - 26

CS Converse of a conditional Statement – (3 – 27)

CS Writing Converse – 18

CS Writing Converse – 18a

CS Contrapositive of a Conditional Statement– 28

CS Writing Contrapositivity – 19

CS Writing Contrapositivity – 19a