1 6001210-3 Discrete Mathematics Lecture1 Miss.Amal Alshardy.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Geometry Logic.
TRUTH TABLES Section 1.3.
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.
Truth Tables Presented by: Tutorial Services The Math Center.
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
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.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
Logic ChAPTER 3.
1 Propositional Logic Section Definition A proposition is a declarative sentence that is either true or false but not both nor neither Any proposition.
The Foundations: Logic and Proofs
1 Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta Office: CSEB 3043 Phone: ext
Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.
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.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
Discrete Maths 2. Propositional Logic Objective
Discrete Mathematics and Its Applications
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Chapter 1: The Foundations: Logic and Proofs
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
CSci 2011 Textbook ^Discrete Mathematics and Its Applications,  Rosen  6th Edition  McGraw Hill  2006.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Chapter 7 Logic, Sets, and Counting
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Conditional Statements
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.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
How do I show that two compound propositions are logically equivalent?
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.
1/10/ Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone:
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
1 Boolean Logic CS/APMA 202, Spring 2005 Rosen, section 1.1 Aaron Bloomfield.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
Ms. Andrejko 2-2 Logic. Real World Legally Blonde.
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.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Chapter 1 Logic and proofs
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
Logic.
Information Technology Department
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
Presentation transcript:

Discrete Mathematics Lecture1 Miss.Amal Alshardy

2 Instruction Kenneth H. Rosen. Discrete Mathematics and Its Applications, 6th Edition Exams: 2 tests (40%), final (40%) Homework (10%): equally divided between several assignments.  HW submitted late will not be graded.  Cheating HW will not be graded Class attendance(10%) Each class slid should be with you. Textbook:

3 Propositional Logic  Truth values, truth tables  Conjunction (  )  Negation (  )  Disjunction (  )  Implication (  )  Biconditional (  )  Exclusive OR(  )

4 Propositions Declarative sentence(sentence that declares a fact) Must be either True or False. Propositions: UQU is in Makkah (T) 1+1=2 (T) 2+2=3 (F) jeddah is capital of Saudi Arabia (F) Not propositions: Do you like this class? Read this carrfully X+1=2 Are not declares a fact They are neither true nor false

5 cont. Propositions Truth value: True or False proposition Variables: Variables that represent proposition.. We will use letters to denote proposition Variables: p,q,r,s,… Negation:  p (“not p”) Truth table for negation p pp TF FT

6 cont. negating propositions  p: “is the opposite of the truth value of p”  p: “it is not the case that p” p: “it rained more than 20 inches in TO” p: “John has many iPads” Page 3 Find the negation of this two proposition

Conjunction: p  q [“and”] 7 pq p  qp  q TTT TFF FTF FFF e.g p: It is snowing q: It is below freezing N propositions 2 N possibility

8 Page 3

9 Disjunction: p  q [“or”] pq p  q TTT TFT FTT FFF e.g p: It is snowing q: It is below freezing

10

11 Exclusive OR (XOR) p  q – T if p and q have different truth values, F otherwise pq p  q TTF TFT FTT FFF

12 Conditional:p  q [“if p then q”] p: hypothesis, q: conclusion E.g.:p: “If you turn in a homework late, then it will not be graded”; “If you get 100% in this course, then you will get an A+”.

Conditional:p  q [“if p then q”] 13 pqp  qp  q TTT TFF FTT FFT

14 Conditional statement terminology

From the definition of a conditional statement find if this two statements are True or False and why??? “If today is Sunday,then 2+6=8” “If today is Sunday,then 2+6=3” 15

BiConditional:p q [“p iff q”] 16 pqp q TTT TFF FTF FFT Biconditional statement terminology

It is below freezing and it is snowing It is below freezing but not snowing It is not below freezing and it is not snowing It is either snowing or below freezing (or both) If it is below freezing, it is also snowing That it is below freezing is necessary and sufficient for it to be snowing 17 HW

Logical equivalent: 18

((  P)↔Q)≡(P↔(  Q)) 19

20

21