Truth Tables How to build them

Slides:



Advertisements
Similar presentations
Computing Truth Value.
Advertisements

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.
Truth Functional Logic
Chapter 21: Truth Tables.
Truth Tables How to Make and Use. Making a Truth Table To determine the number of rows other than the heading row. To determine the number of rows other.
Logic & Critical Reasoning
Logic & Critical Reasoning
Formal Semantics of S. Semantics and Interpretations There are two kinds of interpretation we can give to wffs: –Assigning natural language sentences.
For Wednesday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C.
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.
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.
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.
Copyright © Cengage Learning. All rights reserved.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
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.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
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.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
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
Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.
Thinking Mathematically Arguments and Truth Tables.
Logic UNIT 1.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
 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.
Logic.
Deductive reasoning.
2. The Logic of Compound Statements Summary
AND.
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
How do I show that two compound propositions are logically equivalent?
6.1 Symbols and Translation
Chapter 8 Logic Topics
Evaluating truth tables
Propositional Equivalences
Truth Tables Hurley
CS201: Data Structures and Discrete Mathematics I
Section 3.5 Symbolic Arguments
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
TRUTH TABLES.
TRUTH TABLES continued.
The Method of Deduction
The Logic of Declarative Statements
Logical Truth To show a statement A is a logic truth (tautology) ...
Deductive Arguments: Checking for Validity
Deductive Arguments: More Truth Tables
6.3 Truth Tables for Propositions
Statements of Symbolic Logic
TRUTH TABLES.
Introductory Logic PHI 120
Section 3.3 Truth Tables for the Conditional and Biconditional
Truth Tables for the Conditional and Biconditional
6.4 Truth Tables for Arguments
8C Truth Tables, 8D, 8E Implications 8F Valid Arguments
2-2 Logic Part 2 Truth Tables.
CS201: Data Structures and Discrete Mathematics I
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 Tables How to build them How to use them to determine logical properties of statements How to use them to determine logical relations between statements How to use them to determine validity or invalidity

A truth table exhibits all the possible truth values of a set of simple statements The number of lines the table requires, to show all possible truth values, depends on the number of simple statements in the example. The number of lines needed is 2 to the nth power, where “n” is the number of distinct simple statements (p . q) v ~(p . q) p > q (p v q) . r 4 lines 8 lines 4 lines

Fill in the truth values for the simple statements Start on the left, and halve the number of rows Make the first half True, the second half False At the next simple statement, halve the number you halved. Make the first half of those True, the next half false Continue until you get a column reading T F T F

~ ( p v q) T F

~ ( p v q) T t F f

~ ( p v q) f T t F

p v ( q . r) t f

p v ( q . r) t f

p v ( q . r) t f

(p > q) . ( r > s) t f

(p > q) . ( r > s) t f

(p > q) . ( r > s) t f

(p > q) . ( r > s) t T F f

All three examples just seen have a feature in common: Each statement is TRUE on some lines of the table, but FALSE on others Look under the MAIN OPERATOR to see the final truth value for the statement

A statement that is T sometimes, and F other times is called “CONTINGENT” This means that its truth value depends upon (is contingent upon) the truth value of the simple statements.

Tautology Self-Contradiction There are two other possibilities The value under the main operator is TRUE in all cases Tautology Or: the value under the main operator is FALSE in all cases Self-Contradiction

(A . B) v ~ ( A . B) T F

(A . B) v ~ ( A . B) T F

(A . B) v ~ ( A . B) T F

(A . B) v ~ ( A . B) T F T

(p > q) . (~q . p) T F

(p > q) . (~q . p) T F

When a statement is always TRUE or always FALSE, regardless of the truth value of its component statements, this is due to its structure or form – not to its content. This is similar to the point made about DEDUCTION in general: validity is a function of structure or form.

Contingent Tautologous Self-contradictory Logical properties of truth-functional compound statements Contingent Tautologous Self-contradictory

Truth tables can also show relationships between statements or sets of statements ~ (p v q) (~ p v ~ q) Take a minute, and write up the truth tables for these

~ (p v q) (~p v ~q) T F

~ (p v q) (~p v ~q) F T

~ (p v q) (~p v ~q) F T Sometimes these are the same as one another, but not always: they are not equivalent.

Between any two (or three or four, etc) statements, there are four possibilities: They may be EQUIVALENT: having the same value under the main operator on every line They may be CONTRADICTORY: having opposite values under the main operator on every line They may be CONSISTENT: all TRUE on at least one line (in at least one case; under at least one set of circumstances) They may be INCONSISTENT: never all TRUE under any set of circumstances

VALIDITY Truth tables define the logical operators They exhibit logical properties of statements: contingent; tautology; self-contradiction They exhibit logical relations between statements: equivalent contradiction consistent inconsistent And they let us test arguments for VALIDITY

what is validity? The property of : it being impossible for a false conclusion to follow from true premises

what is invalidity? The property of: IT BEING POSSIBLE FOR A FALSE CONCLUSION TO FOLLOW FROM TRUE PREMISES

How to lay out a table for an argument (p > q) / ~p // ~q T F Single slash “/” to separate premises Double slash “//” to set off the conclusion (far right)

The possibility --or the impossibility-- of a False What does this table show? (p > q) / ~p // ~q T F The possibility --or the impossibility-- of a False conclusion coming from True premises?

p > q / p // q

p > q / p // q T F

p > q / p // q T F

p v q / ~p // q T F

p v q / ~p // q T F

p v q / ~p // q T F Disjunctive Syllogism What is this called?

T F p > q / q > r // p > r What is this called? Hypothetical Syllogism

p > q / q > r // p > r T F

Russell was either a realist or an empiricist. If the former, then he was not an idealist, so he was not an empiricist. R v E / R > ~I // ~ E

Russell was either a realist or an empiricist. If the former, then he was not an idealist, so he was not an empiricist. R v E / R > ~I // ~ E T F t F T f

Russell was either a realist or an empiricist. If the former, then he was not an idealist, so he was not an empiricist. R v E / R > ~I // ~ E T F F t T f

T F If Sartre's an existentialist, then Wittgenstein wrote the Tractatus, therefore if Wittgenstein wrote the Tractatus, Sartre's an existentialist. S > W // W > S S > W // W > S T F

T F If Sartre's an existentialist, then Wittgenstein wrote the Tractatus, therefore if Wittgenstein wrote the Tractatus, Sartre's an existentialist. S > W // W > S S > W // W > S T F