Propositions and Truth Tables

Slides:



Advertisements
Similar presentations
Logic ChAPTER 3.
Advertisements

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.
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.
Logic 2 The conditional and biconditional
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.
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.
Discrete Mathematics Math 6A Instructor: M. Welling.
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
Adapted from Discrete Math
IB Math Studies – Topic 3. IB Course Guide Description.
Propositions and Truth Tables. Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Discrete Maths 2. Propositional Logic Objective
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.
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.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Review I Rosen , 3.1 Know your definitions!
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
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.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
Thinking Mathematically
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
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.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
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
Logic The study of correct reasoning.
2. The Logic of Compound Statements Summary
CSNB 143 Discrete Mathematical Structures
Today’s Topics Symbolizing conditionals and bi-conditionals
Logic.
CPCS222 Discrete Structures I
Truth Tables – Logic (Continued)
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
Information Technology Department
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
(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
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
Section 3.3 Truth Tables for the Conditional and Biconditional
Truth Tables for the Conditional and Biconditional
1.3 Propositional Equivalences
CHAPTER 3 Logic.
Logic and Reasoning.
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? 2 + 3 = 23 NO YES NO 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 If you are sleeping, then you are breathing. Converse of p  q is q  p If you are breathing, then you are sleeping. Inverse of p  q is p  q If you are not sleeping, then you are not breathing. Contrapositive of p  q is the proposition  q  p If you are not breathing, then you are not sleeping.

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

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)