Statements of Symbolic Logic

Slides:



Advertisements
Similar presentations
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.
Advertisements

Logic & Critical Reasoning
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
CS128 – Discrete Mathematics for Computer Science
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Adapted from Discrete Math
Truth Tables for Negation, Conjunction, and Disjunction.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Propositions and Truth Tables
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional.
Thinking Mathematically
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
3.3 – The Conditional A conditional statement is a compound statement that uses the connective if…then. The conditional is written with an arrow, so “if.
 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.
2.2 Truth Tables for Negation, Conjunction, and Disjunction.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.
Simple Logic.
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
2. The Logic of Compound Statements Summary
AND.
CSNB 143 Discrete Mathematical Structures
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
How do I show that two compound propositions are logically equivalent?
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Truth Tables for Negation, Conjunction, and Disjunction
Discrete Mathematics Lecture # 2.
6.1 Symbols and Translation
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1.2 Propositional Equivalences
Information Technology Department
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Section 3.4 Equivalent Statements
TRUTH TABLES.
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
Symbolic Logic 2/25/2019 rd.
1.2 Propositional Equivalences
Discrete Mathematics Lecture 2: Propositional Logic
Equivalent Statements
Section 3.7 Switching Circuits
Introductory Logic PHI 120
CHAPTER 3 Logic.
Section 3.3 Truth Tables for the Conditional and Biconditional
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
Statements and Logical Connectives
CHAPTER 3 Logic.
Section 3.4 Equivalent Statements
2-2 Logic Part 2 Truth Tables.
2-2 Logic Vocab Statement: A sentence that is either true or false
CHAPTER 3 Logic.
Truth Tables for Conditional and Biconditional Statements
Presentation transcript:

Statements of Symbolic Logic Name Symbolic Form Negation ~p Conjunction p  q Disjunction p  q Conditional p  q Biconditional p  q Negation ~(p) "It is false that,..." " Is not true that,.." " It is not the case that.."

3.2: Truth Tables: Negation, Conjunction, and Disjunction p q r T F A truth table is used to determine when a compound statement is true or false. p q T T T F F T F F p T F 2

Negation (not): Opposite truth value from the statement. Truth Tables Negation p ~p T F Negation (not): Opposite truth value from the statement. Conjunction p q p  q T T T F F T F F Conjunction (and): Only true when both statements are true. 3

Truth Tables Disjunction (or): Only false when both statements are false. Disjunction p q p  q T T T F F T F F Disjunction p q p  q T T T T F F T F F F 4

Construct a Truth Table Construct a truth table for ~p ⋀ ~q. p q ~p ~q ~p ⋀ ~q T T T F F T F F 5

Constructing a Truth Table Construct a truth table for (~p  q)  ~q. p q ~p  q ~q (~p  q)  ~q T T T F F T F F p q ~p ~p  q ~q (~p  q)  ~q T T T F F T F F 6

Truth Table with a Negation Construct a truth table for ~(~q ⋁ p). p q T T T F F T F F 7

Truth Table with a 8 Cases Construct a truth table for (p ^ ~q) v r. p q r T T T T T F T F T T F F F T T F T F F F T F F F 8

Determine the Truth Value of a Compound Statement Determine the truth value for each simple statement. Then, using these truth values, determine the truth value of the compound statement. 15 is less than or equal to 9. Let p: 15 is less than 9. q: 15 is equal to 9. 9

Truth Tables for Conditional Statements 3.3: Truth Tables: Conditional, biconditional Truth Tables for Conditional Statements Conditional p q p  q T T T F F T F F Conditional p q p  q T T T F F T F F p  q antecedent  consequent If p then q. A conditional is false only when the antecedent is true and the consequent is false. 10

Construct a truth table for ~q  ~p p q T T T F F T F F p q T T T F F T F F 11

Biconditional Statements p  q p if and only if q: p  q and q  p True only when the component statements have the same value. Truth table for the Biconditional p q T T T F F T F F p q T T T F F T F F 12

A Truth Table Using a Biconditional Construct a truth table for the statement ~p ↔ (~q → r). p q r T F T F T F 13

Using Real Data in Compound Statements The graph on the next slide represents the student population by age group in 2009 for the State College of Florida (SCF). Use this graph to determine the truth value of the following compound statements. 14

Using Real Data in Compound Statements If 37% of the SCF population is younger than 21 or 26% of the SCF population is age 21–30, then 13% of the SCF population is age 31–40. 15

Using Real Data in Compound Statements 3% of the SCF population is older than 50 and 8% of the SCF population is age 41–50, if and only if 19% of the SCF population is age 21–30. 16

Construct a truth table for p  ~ p Some compound statement are false in all possible cases. Such statements are called self-contradictions. 17

Tautology A tautology is a compound statement that is always true. When every truth value in the answer column of the truth table is true, the statement is a tautology. 18

Construct a truth table for the statement (p ⋀ q) → (p ⋁ r) Construct a truth table for the statement (p ⋀ q) → (p ⋁ r). Is this a tautology? p q r T F T F T F 19

Construct a truth table for [( p  q) ~ p]  q T T T F F T F F p q T T T F F T F F Conditional statements that are tautologies are called implications. 20