Propositional Logic 6.2 Truth Functions.

Slides:



Advertisements
Similar presentations
Logic & Critical Reasoning Translation into Propositional Logic.
Advertisements

PROOF BY CONTRADICTION
The Logic of Quantified Statements
Symbolic Logic: The Language of Modern Logic
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
6.1 Symbols and Translation
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
James Tam AND OR NOT NAND NOR XOR Basic logic operations (fascinating)
Can you use your clicker? 1. Yes 2. No. Let A = we won the first game, B = we won the second game, and C = we are first in the league. The following sentence.
Tweedledum: “I know what you’re thinking, but it isn’t so. No how.” Tweedledee: “Contrariwise, if it was so, it might be; and if it were so, it would be;
The Language of Propositional Logic The Syntax and Semantics of PL.
Computer Science 101 The Boolean System. George Boole British mathematician ( ) Boolean algebra –Logic –Set theory –Circuits –Conditions in if.
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
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.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.
Algebra Equations Lesson 1-7 Pages Equations An Equation is a sentence that contains an equals = sign. The equals = sign tells you that the expression.
Thinking Mathematically
Propositional Logic Symbolic logic If A, then B A  B Capital letters stand for simple sentences A simple sentence is an affirmative single statement “It’s.
IB Computer Science – Logic
Chapter 1: The Foundations: Logic and Proofs
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Chapter 1 – Part 3 ELEMENTARY LOGIC
Computer Science 210 Computer Organization
Logic Day #2 Math Studies IB NPHS Miss Rose
DISCRETE MATHEMATICS CHAPTER I.
Truth Tables and Equivalent Statements
Chapter 1 Logic and Proofs.
How do I show that two compound propositions are logically equivalent?
Basic Logical Operations (Fascinating)
6.1 Symbols and Translation
Conditional Statements
Computer Science 210 Computer Organization
1.2 Propositional Equivalences
Propositional Equivalences
Types, Truth, and Expressions (Part 2)
Computer Science 210 Computer Organization
Hurley … Chapter 6.5 Indirect Truth Tables
Section 1-3 Equations.
Dots 5 × TABLES MULTIPLICATION.
Dots 5 × TABLES MULTIPLICATION.
Mo’ Truth Tables Part II.
Dots 2 × TABLES MULTIPLICATION.
Types, Truth, and Expressions (Part 2)
Discrete Mathematics Lecture 2: Propositional Logic
The animated version (teaching method 2) Chalk v.s. The Computer
Discrete Mathematics Lecture # 3.
Dots 3 × TABLES MULTIPLICATION.
Deductive Arguments: More Truth Tables
What are the following properties?
1.2 Propositional Equivalences
6.3 Truth Tables for Propositions
Klenk's Tree Method for Determining the Truth Values of Statements
Dots 6 × TABLES MULTIPLICATION.
Discrete Mathematics Lecture 2: Propositional Logic
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
Dots 2 × TABLES MULTIPLICATION.
1.2 Propositional Equivalences
Dots 4 × TABLES MULTIPLICATION.
Topics discussed in this section:
2-2 Logic Part 2 Truth Tables.
Philosophical Methods
Logical truths, contradictions and disjunctive normal form
Truth tables.
Dots 3 × TABLES MULTIPLICATION.
Propositional Satisfiability
Presentation transcript:

Propositional Logic 6.2 Truth Functions

Truth Functions Truth functions for the tilde: Plug in truth p ~p T F Out comes falsehood Out comes truth Plug in falsehood

Truth Functions Truth functions for the dot: Let p = Jack went up the hill. Let q = Jill went up the hill. If both of them actually went up the hill, what should we say about the sentence, p • q? p q p • q T F T If Jack went but Jill didn’t, what should we say about the sentence, p • q? F If Jack didn’t go but Jill did, what should we say about the sentence, p • q? F F If neither of them went, what should we say about the sentence, p • q?

Truth Functions Truth functions for the wedge: Let p = Jack went up the hill. Let q = Jill went up the hill. If both of them actually went up the hill, what should we say about the sentence, p v q? p q p v q T F T If Jack went but Jill didn’t, what should we say about the sentence, p v q? T If Jack didn’t go but Jill did, what should we say about the sentence, p v q? T F If neither of them went, what should we say about the sentence, p v q?

Truth Functions Truth functions for the horseshoe (arrow): Let p = Jack went up the hill. Let q = Jill went up the hill. If both of them actually went up the hill, what should we say about the sentence, p → q? p q p → q T F T If Jack went but Jill didn’t, what should we say about the sentence, p → q? F If Jack didn’t go but Jill did, what should we say about the sentence, p → q? T T If neither of them went, what should we say about the sentence, p → q?

Truth Functions Truth functions for the triple bar: Let p = Jack went up the hill. Let q = Jill went up the hill. If both of them actually went up the hill, what should we say about the sentence, p Ξ q? p q p Ξ q T F T If Jack went but Jill didn’t, what should we say about the sentence, p Ξ q? F If Jack didn’t go but Jill did, what should we say about the sentence, p Ξ q? F T If neither of them went, what should we say about the sentence, p Ξ q?

Truth Functions If the truth table for the horseshoe bothers you, just translate it to this: ~p v q So, saying to a troublemaker in the bar: If you stay, I’ll flatten you (S  F) Is the same as saying Leave or I’ll flatten you (~S v F)

Computing Truth Values of Big Propositions True: A, B, and C False: D, E, and F What’s the truth value of … (A v D)  E ?

Computing Truth Values of Big Propositions True: A, B, and C False: D, E, and F (A v D)  E (T v F)  F (put in the truth values) T  F (simplify from truth table) F

Computing Truth Values of Big Propositions True: A, B, and C False: D, E, and F (B • C)  (E  A) (T • T)  (F  T) (put in the truth values) T  T (simplify from truth table) T