Propositions and Truth Tables. Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Chapter 1: The Foundations: Logic and Proofs
Logic ChAPTER 3.
Grading Lecture attendance: -1% per 2 unexcused absences
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.
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Propositional Equivalences. L32 Agenda Tautologies Logical Equivalences.
UNIT-I Statements and Notations Connectives Normal Forms
CS128 – Discrete Mathematics for Computer Science
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
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.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
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.
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
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Propositions and Truth Tables
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
Discrete Maths 2. Propositional Logic Objective
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.
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.
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.
Discrete Mathematics. Propositional Logic 10/8/2015 What’s a proposition? PropositionsNot Propositions = 32Bring me coffee! CS173 is Bryan’s favorite.
Review I Rosen , 3.1 Know your definitions!
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Tautologies, contradictions, contingencies
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
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.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Reading: Chapter 4 (44-59) from the text book
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
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.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Chapter 1: The Foundations: Logic and Proofs
The Foundations: Logic and Proof, Sets, and Foundations PROPOSITIONS A proposition is a declarative sentence that is either True or False, but not the.
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.
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
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.
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.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
INTRODUCTION TO LOGIC. PURPOSE: – To distinguish good arguments from poor ones Arguments consist of STATEMENTS – A statement is a sentence that can be.
Simple Logic.
Chapter 1 Propositional Logic
2. The Logic of Compound Statements Summary
CSNB 143 Discrete Mathematical Structures
Logic.
Truth Tables – Logic (Continued)
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
Information Technology Department
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
Symbolic Logic 2/25/2019 rd.
MAT 3100 Introduction to Proof
Statements of Symbolic Logic
1.3 Propositional Equivalences
Presentation transcript:

Propositions and Truth Tables

Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.

Are these propositions? Over the mountain and through the woods. All apples are fruit. The quick, brown fox. Are you here? = 23 NO YES NO YES

Negation of p Let p be a proposition. The statement “It is not the case that p” is also a proposition, called the “negation of p” or  p (read “not p”) Table 1. The Truth Table for the Negation of a Proposition p  p T F F T p = The sky is blue.  p = It is not the case that the sky is blue.  p = The sky is not blue.

Conjunction of p and q: AND Let p and q be propositions. The proposition “p and q,” denoted by p  q is true when both p and q are true and is false otherwise. This is called the conjunction of p and q. Table 2. The Truth Table for the Conjunction of two propositions p q p  q T T T T F F F T F F F F

Disjunction of p and q: OR Let p and q be propositions. The proposition “p or q,” denoted by p  q, is the proposition that is false when p and q are both false and true otherwise. Table 3. The Truth Table for the Disjunction of two propositions p q p  q T T T T F T F T T F F F

Two types of OR INCLUSIVE OR means “either or both” EXCLUSIVE OR means “one or the other, but not both”

Two types of Disjunction of p and q: OR INCLUSIVE OR means “either or both” p q p  q T T T T F T F T T F F F EXCLUSIVE OR means “one or the other, but not both” p q p  q T T F T F T F T T F F F

Implications If p, then q p implies q if p, q p only if q p is sufficient for q q if p q whenever p q is necessary for p Proposition p = antecedent Proposition q = consequent

Converse, Inverse, Contrapositive Conditional p  q Contrapositive of p  q is the proposition  q   p. Converse of p  q is q  p Inverse of p  q is  p   q If you are not breathing, then you are not sleeping p You are sleeping q you are breathing If you are sleeping, then you are breathing. If you are breathing, then you are sleeping. If you are not sleeping, then you are not breathing.

Find the conditional, converse, inverse and contrapositive: Conditional p  q Contrapositive of p  q is the proposition  q   p Converse of p  q is q  p Inverse of p  q is  p   q If the sun is shining, then it is warm outside. p The sun is shinning q it is warm outside If it is warm outside, then the sun is shining. If the sun is not shining, then it is not warm outside. If it is not warm outside, the sun is not shining.

Biconditional Let p and q be propositions. The biconditional p  q is the proposition that is true when p and q have the same truth values and is false otherwise. “p if and only if q, p is necessary and sufficient for q” Table 6. The Truth Table for the biconditional p  q. p q p  q T T T T F F F T F F F T

Logical Equivalence An important technique in proofs is to replace a statement with another statement that is “logically equivalent.” Tautology: compound proposition that is always true regardless of the truth values of the propositions in it. Contradiction: Compound proposition that is always false regardless of the truth values of the propositions in it.

Logically Equivalent Compound propositions P and Q are logically equivalent if P  Q is a tautology. In other words, P and Q have the same truth values for all combinations of truth values of simple propositions. This is denoted: P  Q (or by P Q)

(T/F) Conditional (T/F) Converse (T/F)Inverse (T/F)Contrapositive p m  C = 100° q  ABC is obtuse If m  C = 100°, then  ABC is obtuse. If  ABC is obtuse then m  C = 100°, If m  C ≠ 100°, then  ABC is not obtuse. If  ABC is not obtuse, then m  C ≠100°

(T/F) Conditional (T/F) Converse (T/F)Inverse (T/F)Contrapositive If  ABC is isosceles, then it is equilateral If  ABC is not equilateral, then it is not isosceles If  ABC is not isosceles, then it is not equilateral If  ABC is equilateral, then it is isosceles p  ABC is equilateral q it is isosceles

(T/F) Conditional (T/F) Converse (T/F)Inverse (T/F)Contrapositive p G is the midpoint of KL q GQ bisects KL If G is the midpoint of KL, then GQ bisects KL. If GQ bisects KL, G is the midpoint of KL. If G is not the midpoint of KL, then GQ does not bisects KL. If GQ does not bisects KL then G is not the midpoint of KL.

Let R = “I work at this school” and D = “My name is Ms. D” Translate the following symbols into sentences, and indicate T/F: a.D  R: ___ (T/F) b. R  D: ___ (T/F) c. ~D  ~R: ___ (T/F) If my name is Ms. D, then I work at this school. If I work at this school, then my name is Ms. D. If my name is not Ms. D, then I do not work at this school.

5. Given: a. If today is warm, the pool will be crowded. b. If it rains today, the pool will not be crowded. c. Either today is warm or I will wear a long- sleeved shirt. d. It will not rain today. Using W, P, R, S, & proper connectives (~, , etc.), express each sentence into symbolic form. Let W represent “Today is warm.” Let P represent “The pool will be crowded.” Let R represent “It rains today.” Let S represent “I will wear a long-sleeved shirt.”

FTTFFTTF FTTFFTTF TTFTTTFT TFFTTFFT FTFTFTFT TFTFTFTF FFTTFFTT FTFTFTFT TFTTTFTT TFFTTFFT FFTFFFTF FFTTFFTT TFTFTFTF TFTFTFTF TFFTTFFT TTFTTTFT FTFTFTFT TFFTTFFT FTFTFTFT TFFTTFFT 6. (p ^ w) ~(p ^ w) 7. p (w  v) p  (w  v) 8. (v  t) r (v  t)  r 9. (k  p) g g  (k  p)10. ~w  r t (~w  r)  t 11. ~b (k  p) (k  p)  ~b 12. (n  j) e (n  j)  e 13. u (~h  c) (~h  c)  u 14 (w  ~ ~r) ~(w  ~ ~ r) 15. f  r ~t ( f  r)  ~t 16. (j  u) ~y ~y  (j  u) (j  u)  ~y TTFTTTFT TTFTTTFT TFTTTFTT TFTTTFTT FTTTFTTT FFTFFFTF TFFTTFFT TTTFTTTF FFFTFFFT TTFTTTFT FFTTFFTT FFFFFFFF