Klenk's Tree Method for Determining the Truth Values of Statements

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

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.

Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.

MODULE 3 Lesson 16. Objective Compare two three-digit numbers using, and =.

Truth Trees Intermediate Logic.

Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.

For Wed, read Chapter 3, section 3. Nongraded Homework: Exercises the end of the section. Even better, do Power of Logic, 7.3, A and B. Graded homework.

The Language of Propositional Logic The Syntax and Semantics of PL.

Prime Factorization (Factor Trees)

No new reading for Wednesday. Exam #1 will be given in class on Friday. It covers Chapters 1 and 2 (except for chapter 2, section 6). On Monday, I’ll give.

Dale Roberts Program Control using Java - Boolean Expressions Dale Roberts, Lecturer Computer Science, IUPUI Department of.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.

Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.

Conditional. Conditional Statements Vocabulary Conditional: A compound sentence formed by using the words if….then. Given the simple sentences p and q,

TABLES AND VALUES Section 1.5. Open Sentence Equation.

Thinking Mathematically

1.3 Exploring Real Numbers Textbook pg 17. Terminology Natural Numbers: {1, 2, 3, 4, 5, 6,…} Whole Numbers: {0, 1, 2, 3, 4, 5,…} Integers: {…,-3, -2,

Lecture 6 Excess Notation. Excess 8 notation indicates that the value for zero is the bit pattern for 8, that is 1000 Excess 8 notation indicates that.

CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.

5 Minute Check Determine the missing digit to make the statement true. Complete on the back of your homework. 1. 6, ?59 is divisible by 3. 2.

Section 1.1 Propositions and Logical Operations. Introduction Remember that discrete is –the study of decision making in non-continuous systems. That.

Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.

Week 8 Discussion: Ch 8, TA: Karin Howe PHIL 121 Spring 2012.

Introductory Logic PHI 120 Presentation: "Truth Tables – Sentences"

 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.

CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.

CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.

Truth Tables for Negation, Conjunction, and Disjunction

Presented by: Tutorial Services The Math Center

2. Breaking down numbers into

Propositional Logic.

Thinking Mathematically

Truth Tables and Equivalent Statements

Truth Tables for Negation, Conjunction, and Disjunction

Classwork/Homework Classwork – Page 90 (11 – 49 odd)

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Mathematics for Computing

Place Value: Comparing, Ordering, & Rounding

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Arrays, For loop While loop Do while loop

Looping and Repetition

Types, Truth, and Expressions (Part 2)

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

CS201: Data Structures and Discrete Mathematics I

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

(1.4) An Introduction to Logic

Mo’ Truth Tables Part II.

Types, Truth, and Expressions (Part 2)

Solve and Graph 2x + 3 < 9 2x + 3 = x = x = 3

The animated version (teaching method 2) Chalk v.s. The Computer

Truth tables 3.2 and 3.3 Constructing Truth tables

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

Statements of Symbolic Logic

And represent them using Venn Diagrams.

Introductory Logic PHI 120

Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction

Statements and Logical Connectives

Chapter 3: Selection Structures: Making Decisions

2-2 Logic Part 2 Truth Tables.

CS201: Data Structures and Discrete Mathematics I

2-2 Logic Vocab Statement: A sentence that is either true or false

Logical truths, contradictions and disjunctive normal form

Logical equivalence.

Propositional Satisfiability

Presentation transcript:

Klenk's Tree Method for Determining the Truth Values of Statements

Steps for Computing Truth Values Place the truth values of the simple sentences immediately above the atomic formulas. (A, B, C, etc.) Check the statement for any negations attached to atomic formulas (~A, ~B, ~C, etc.) Write the truth value for these negations immediately below them. Starting with the smallest subformulas and working your way out, determine the truth values of each subformula based on the truth values of its subformulas and the truth table for the major operator of the subformula. Write these truth value below the subformula, connecting it to the atomic formulas with arrows. "Bring down" the truth values for any atomic formulas that remain to be dealt with. Repeat Step 3 until you have worked your way out to the major operator of the formula as a whole.

Example 1 Let A and B be true, and let Z be false T F Step 1 ~{[(A  B)  Z] [(B  Z)  ~A]} F T Step 3a F Step 2 Step 3b F F Step 3c Note: This is the second example on pg. 43 of Klenk, except I've fixed the typo (missing the last set of brackets) so that *now* her explanation makes sense. Step 3d T Done!!

Example 2 Let A and B be true, and let X, Y and Z be false T F Step 1 ({[(A  B)  X]  Z}  Y)  {[(X  Z)  A]  X} Step 2 (skip) T F Step 3a Step 3b F T Step 3c T F F Step 3d Step 3e T Done!!