1 Statements and Operations Statements and operators can be combined in any way to form new statements. PQ PQPQPQPQ  (P  Q) (  P)  (  Q) TTTFF.

Slides:



Advertisements
Similar presentations
Truth Tables How to Make and Use. Making a Truth Table To determine the number of rows other than the heading row. To determine the number of rows other.
Advertisements

Propositional Equivalences
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
CS128 – Discrete Mathematics for Computer Science
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
Introduction to Logic Sections 1.1 and 1.2 of Rosen Spring 2010
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
Discrete Mathematics Math 6A Instructor: M. Welling.
Introduction to Logic Sections 1.1 and 1.2 of Rosen Fall 2010 CSCE 235 Introduction to Discrete Structures URL: cse.unl.edu/~cse235 Questions:
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
Adapted from Discrete Math
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
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.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
The Foundations: Logic and Proofs
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Discrete Mathematics and Its Applications
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
CS 103 Discrete Structures Lecture 02
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Spring 2003CMSC Discrete Structures1 Let’s get started with... Logic !
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Fall 2002CMSC Discrete Structures1 Let’s get started with... Logic !
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Discrete Structures – CS Text Discrete Mathematics and Its Applications Kenneth H. Rosen (7 th Edition) Chapter 1 The Foundations: Logic and Proofs.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Thinking Mathematically
Chapter 1: The Foundations: Logic and Proofs
Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
Spring 2003CMSC Discrete Structures1 Let’s get started with... Logic !
3/6/20161 Let’s get started with... Logic !. 3/6/20162 Logic Crucial for mathematical reasoningCrucial for mathematical reasoning Used for designing electronic.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
Law of logic Lecture 4.
Ch01-Logic 1. Logic Crucial for mathematical reasoningCrucial for mathematical reasoning Used for designing electronic circuitryUsed for designing electronic.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Chapter 1 Propositional Logic
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
Discrete Mathematics Logic.
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Citra Noviyasari, S.Si, MT
MATH 245 Spring 2009 This is mathematics for computer science
CPCS222 Discrete Structures I
Discrete Mathematics Lecture # 2.
CMSC Discrete Structures
Chapter 8 Logic Topics
Propositional Equivalences
Information Technology Department
CS201: Data Structures and Discrete Mathematics I
CMSC Discrete Structures
Discrete Mathematics Logic.
Symbolic Logic 2/25/2019 rd.
MAT 3100 Introduction to Proof
Cs Discrete Mathematics
1.2 Propositional Equivalences
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

1 Statements and Operations Statements and operators can be combined in any way to form new statements. PQ PQPQPQPQ  (P  Q) (  P)  (  Q) TTTFF TFFTT FTFTT FFFTT

2 Exercises To take discrete mathematics, you must have taken calculus or a course in computer science.To take discrete mathematics, you must have taken calculus or a course in computer science. When you buy a new car from Toyota Motor Company, you get SAR2000 back in cash or a 2% car loan.When you buy a new car from Toyota Motor Company, you get SAR2000 back in cash or a 2% car loan. School is closed if more than 2 feet of snow falls or if the wind chill is below -100.School is closed if more than 2 feet of snow falls or if the wind chill is below -100.

3 Exercises –P: take discrete mathematics –Q: take calculus –R: take a course in computer science P  Q  RP  Q  R Problem with proposition RProblem with proposition R –What if I want to represent “take COSC 222”? To take discrete mathematics, you must have taken calculus or a course in computer science.To take discrete mathematics, you must have taken calculus or a course in computer science.

Exercises –P: buy a car from Toyota Motor Company –Q: get SAR2000 cash back –R: get a 2% car loan P  Q  RP  Q  R Why use XOR here? – example of ambiguity of natural languagesWhy use XOR here? – example of ambiguity of natural languages When you buy a new car from Toyota Motor Company, you get SAR2000 back in cash or a 2% car loan.When you buy a new car from Toyota Motor Company, you get SAR2000 back in cash or a 2% car loan.

Exercises –P: School is closed –Q: 2 meters of snow falls –R: wind chill is below -100 Q  R  PQ  R  P Precedence among operators:Precedence among operators: , , , ,  School is closed if more than 2 meters of snow falls or if the wind chill is below -100.School is closed if more than 2 meters of snow falls or if the wind chill is below -100.

Compound Statement Example

 If p=>q is an implication, then its converse is the implication q => p and its contrapositive is the implication ~ q => ~p and its contrapositive is the implication ~ q => ~p E.g. E.g. Give the converse and the contrapositive of the implication “If it is raining, then I get wet” Converse: If I get wet, then It is raining. Converse: If I get wet, then It is raining. Contrapositive: If I do not get wet, then It is not raining. Converse and Contrapositive 7

Equivalent Statements PQ  (P  Q) (  P)  (  Q)  (P  Q)  (  P)  (  Q) TTFFT TFTTT FTTTT FFTTT The statements  (P  Q) and (  P)  (  Q) are logically equivalent, since they have the same truth table, or put it in another way,  (P  Q)  (  P)  (  Q) is always true.

9 Tautologies and Contradictions A tautology is a statement that is always true. Examples: –R  (  R) –  (P  Q)  (  P)  (  Q) A contradiction or Absurdity. is a statement that is always false. Examples: –R  (  R) –  (  (P  Q)  (  P)  (  Q)) The negation of any tautology is a contradiction, and the negation of any contradiction is a tautology.

A statement that can be either true or false, depending on the truth values of its propositional variables, is called a contingency. Example A statement that can be either true or false, depending on the truth values of its propositional variables, is called a contingency. Example The statement (p ⇒ q) ∧ (p ∨ q) is a Contingency Contingency