1 Propositional Logic Section 1.1. 2 Definition A proposition is a declarative sentence that is either true or false but not both nor neither Any proposition.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Geometry Logic.
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.
Constructing a Truth Table
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
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.
2/17/2008Sultan Almuhammadi1 ICS Logic & Sets (An Overview) Week 1.
Boolean Algebra Computer Science AND (today is Monday) AND (it is raining) (today is Monday) AND (it is not raining) (today is Friday) AND (it is.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Conditional Statements
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
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
Logic ChAPTER 3.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Chapter 1, Part I: Propositional Logic With Question/Answer Animations.
The Foundations: Logic and Proofs
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
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
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.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Fall 2002CMSC Discrete Structures1 Let’s get started with... Logic !
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
The Foundations Logic and Proofs by raedRASHEED 2014.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
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)
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
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,
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.
How do I show that two compound propositions are logically equivalent?
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
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.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
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.
رياضيات متقطعة لعلوم الحاسب 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
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
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.
Section 1.3 Implications. Vocabulary Words conditional operation ( ⇒ or →) conditional proposition conditional statement (implication statement) hypothesis.
Assign Yourself and Do Now Thursday, January 10, 2013.
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,
Information Technology Department
Presentation transcript:

1 Propositional Logic Section 1.1

2 Definition A proposition is a declarative sentence that is either true or false but not both nor neither Any proposition has a truth value {T, F}

3 Examples StatementPropTruth Value Today is FridayyesF 1+1 = 2 I know that you hate this course Is that correct? Do not answer quickly I’m a liar X+ 2 = 0

4 Examples StatementPropTruth Value Today is FridayYesF 1+1 = 2YesT I know that you hate this courseYesT Is that correct?No Do not answer quicklyNo I’m a liarNo X+ 2 = 0No

5 Proposition Types A proposition could be either simple or compound. Simple: without logical operators Compound: with logical operators (connectives)

6 Logical Operators Let p & q be propositions, then the following are compound propositions: Negation of p:  p = not p Conjunction: p  q = p AND q Disjunction: p  q = p OR q Exclusive OR: p  q = p XOR q Implication: p  q = if p then q Biconditional: p  q = p iff q

7 Negation p = It is raining  p = It is not raining = it is not the case that it is raining Truth table P  p TF FT

8 Conjunction p = it is Friday q = it is raining p  q = it is Friday and it is raining Truth Table: pq p  q TTT TFF FTF FFF

9 Disjunction p = 1> 0 q = monkeys can fly p v q = 1>0 or monkeys can fly Truth Table: pqp v q TTT TFT FTT FFF

10 Conditional Statement: Implication p = I think q = I exist p  q = if I think then I exist Truth Table: pq p  q TTT TFF FTT FFT

11 If p, then q p = hypothesis q = conclusion (consequence) There are many ways to write a conditional statement

12 Other Rephrasing of Implication If p, then q If p, q q if p p is sufficient for q a sufficient condition for q is p a necessary condition for p is q in order to have p true, q has to be true also q when p

13 Other Rephrasing of Implication p  q p implies q p only if q p is true only if q is also true q follows from p

14 Examples of Implication If you get 98% then I’ll give you A+ 98% is sufficient for A+ If you get A+ then it doesn’t mean you have 98% A+ is necessary for 98% 98% however is not necessary for A+ 98% only if A+ A+ follows from 98% 98% doesn’t follow from A+

15 Examples of Implication Notice that if p is true then q must be true, however if p is not true then q may or may not be true.

16 Examples of Implication سورة الأنبياء قَالُوا مَن فَعَلَ هَذَا بِآلِهَتِنَا إِنَّهُ لَمِنَ الظَّالِمِينَ (59) قَالُوا سَمِعْنَا فَتًى يَذْكُرُهُمْ يُقَالُ لَهُ إِبْرَاهِيمُ (60) قَالُوا فَأْتُوا بِهِ عَلَى أَعْيُنِ النَّاسِ لَعَلَّهُمْ يَشْهَدُونَ (61) قَالُوا أَأَنتَ فَعَلْتَ هَذَا بِآلِهَتِنَا يَا إِبْرَاهِيمُ (62) قَالَ بَلْ فَعَلَهُ كَبِيرُهُمْ هَذَا فَاسْأَلُوهُمْ إِن كَانُوا يَنطِقُونَ (63) فَرَجَعُوا إِلَى أَنفُسِهِمْ فَقَالُوا إِنَّكُمْ أَنتُمُ الظَّالِمُونَ (64) ثُمَّ نُكِسُوا عَلَى رُؤُوسِهِمْ لَقَدْ عَلِمْتَ مَا هَؤُلَاء يَنطِقُونَ (65) قَالَ أَفَتَعْبُدُونَ مِن دُونِ اللَّهِ مَا لَا يَنفَعُكُمْ شَيْئاً وَلَا يَضُرُّكُمْ (66) أُفٍّ لَّكُمْ وَلِمَا تَعْبُدُونَ مِن دُونِ اللَّهِ أَفَلَا تَعْقِلُونَ (67) قَالُوا حَرِّقُوهُ وَانصُرُوا آلِهَتَكُمْ إِن كُنتُمْ فَاعِلِينَ (68)

17 Examples of Implication سورة الأنبياء It is very clear that the prophet Ebrahim didn’t lie because he said that If they speak, then the biggest one did it

18 BiConditional Statement p = 1 < 0 q = monkeys can fly p  q = 1< 0 if and only if monkeys can fly Truth Table: pq p  q TTT TFF FTF FFT

19 BiConditional Statement p  q = p if and only if q = p if q and p only if q = “q  p” and “p  q” = “p  q”  “q  p” p is necessary & sufficient for q p and q always have the same truth value

20 Theorem p and q are logically equivalent, i.e., p  q if and only if p  q is always true pq p  qp  q TTTT TFFF FTFF FFTT

21 Example pq pp  p v qp  q TTFTT TFFFF FTTTT FFTTT Logically equivalent  p v q  p  q

22 Precedence of Logical Operators The following operators are sorted according to their precedence , , v, ,  This means for example ( ( ( p  (  q) ) v p v q )  q )  ( ( p  (  q) ) v p )