Truth Functional Logic

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
Advertisements

Truth Tables The aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments. Go To Next Slide.
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.
Chapter 21: Truth Tables.
Logic & Critical Reasoning
Logic & Critical Reasoning
Use a truth table to determine the validity or invalidity of this argument. First, translate into standard form “Martin is not buying a new car, since.
CS128 – Discrete Mathematics for Computer Science
Review: Logic of Categories = Categorical Logic.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Adapted from Discrete Math
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
Methods of Proof involving  Symbolic Logic February 19, 2001.
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.
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.
Thinking Mathematically
Thinking Mathematically Arguments and Truth Tables.
Logic Eric Hoffman Advanced Geometry PLHS Sept
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.
9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
 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.
 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.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Truth Tables, Continued 6.3 and 6.4 March 14th. 6.3 Truth tables for propositions Remember: a truth table gives the truth value of a compound proposition.
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
a valid argument with true premises.
1-4 Solving Inequalities
AND.
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Introduction to Logic Lecture 14 The truth functional argument
Geometry Pre-AP BOMLA LacyMath 10/6.
Truth Tables How to build them
6.1 Symbols and Translation
Logic – Bell Ringer.
Chapter 8 Logic Topics
Evaluating truth tables
Section 3.5 Symbolic Arguments
3.5 Symbolic Arguments.
TRUTH TABLES.
TRUTH TABLES continued.
(1.4) An Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
The Logic of Declarative Statements
Deductive Arguments: More Truth Tables
Inductive Reasoning and Conjecture, and Logic
Statements of Symbolic Logic
And represent them using Venn Diagrams.
Introductory Logic PHI 120
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
6.4 Truth Tables for Arguments
2-2 Logic Vocab Statement: A sentence that is either true or false
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
CHAPTER 3 Logic.
3.5 Symbolic Arguments.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Presentation transcript:

Truth Functional Logic Compound Statements

What is a Truth Table? A truth table is a way of representing a statement’s meaning symbolically. Each compound statement has a single identifying characteristic.

Negation Every claim has a negation or contradictory claim. “Ginger is a dog” has as its negation statement, “Ginger is not a dog.” “Ginger is a dog” = P “Ginger is not a dog” = ~P

Truth Table for Negation Every statement has two possible truth values, T & F. (True or false) P ~P Negation means T F opposite truth value F T If “P” is true, then ~P is false; “P” is false, then ~P is true.

Conjunction Statement A conjunction is a compound claim asserting both the simpler claims contained in it. Thus, a conjunction is true only if both of the claims are also true. A conjunction = P & Q

Truth Table-Conjunction A conjunction has two claims; each have two possible truth values and thus the compound statement has four possible truth values. P Q P & Q Since a conjunction is T T T true only when both first T F F are true, the first case is F T F the key case. F F F

Disjunction A disjunction is a compound claim asserting either or both claims contained in it. Thus, a disjunction is false only if both simpler claims are false. P Q P v Q T T T T F T F T T F F F ↔ This is the key case.

Conditional A conditional asserts the second claim on the condition that the first is true. A conditional thus is false if and only if the first claim is true and the second is false. P Q P →Q T T T T F F ↔ This is key case. F T T F F T

Truth Functional Logic-2 Arguments and Truth Tables

Validity of Arguments The validity of an argument guarantees that if its premises are true, then its conclusion must be true. Thus, an argument is invalid if there is any case where its premises are true and its conclusion false.= Key case.

Truth Table for Arguments If there are two variables, S and P, then you need four lines; if three variables you need eight lines. You will need a column for each premise and the conclusion and for each variable, e.g. S and ~S.

Truth Table-Argument-2 “If building this requires a small Philips screwdriver, then I will not be able to build it. It does require a small Philips screwdriver. Thus, I will not be able to build it. Symbolize: S → ~B, S, Thus, ~B

Truth Table Argument-3 Build the truth table as follows: S B S → ~B S ~B T T F F T F * T F T T T T F T T F F F * F F T T F T There is no line where the premises are true and the conclusion is false and thus the argument is valid.

Truth Table-Argument-4 Martin is not buying a new car {since} he said he would buy a new car or take a Hawaiian vacation. He is now in Maui. Symbolize: C v H H ~ C

Truth Table-Argument- 5 Build a truth table as follows: C H C v H H ~ C T T T T F ↔ Invalid T F T F F F T T T T F F F F T

Truth Table Argument-6 “If you want to over-clock your processor you must make both hardware and software changes. But you either can’t do hardware or can’t do software. So you won’t be over-clocking your processor. Symbolize: O→ (H & S) ~H v ~ S ~ O

Build the Truth Table Because you have three variables you will need eight lines. First column alternates four true with four false Second column- alternates pairs of true and false. Third column- alternate one true and one false all the way down.

The Truth Table T T T T F F T T F F T F T F T F T F T F F F T F O H S 0 →( H & S) (~H v ~S) ~0 T T T T F F T T F F T F T F T F T F T F F F T F F T T T F T F T F F T T F F T F T T F F F F T T There is no case where the conclusion is false and the premises are all true- so it is a valid argument.