(Single Sided) Trees We are not going to cover the double sided

Slides:



Advertisements
Similar presentations
Browse the codebook - to see the list of variables on which you can do statistics select the “Browse codebook in this window” option and then click “Start”
Advertisements

TRUTH TABLES Section 1.3.
8-6 Compound Interest and Exponential Growth
AP Statistics Section 14.2 A. The two-sample z procedures of chapter 13 allowed us to compare the proportions of successes in two groups (either two populations.
Course Orientation Modules Tool. If the Modules tool has been added to the course, use the Modules link in the Course Menu to access course modules.
Statements The most important idea in logic: Validity of an argument.
Through the Looking Glass, 1865
Consistency In logic, ‘consistency’ has two meanings.
Unit 2 Logarithms
Latch Flip flop.
Copyright © 2010 Pearson Education, Inc. All rights reserved Sec
F22H1 Logic and Proof Week 6 Reasoning. How can we show that this is a tautology (section 11.2): The hard way: “logical calculation” The “easy” way: “reasoning”
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
PLTW Courses.  From your desktop, click on My Computer  Select the Student Drive and find the correct course folder  CADD Architecture  CAD II  IED.
Exponential Equations Objective: Solve Exponential equations.
Deductive vs. Inductive Logic This course is about deductive logic. But it is important to know something about inductive logic.
Validity and Conditionals There is a relationship between validity of an argument and a corresponding conditional.
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Chapter 2 Section 2-1: Conditional Statements
1 CA 208 Logic PQ PQPQPQPQPQPQPQPQ
Why Truth Tables? We will learn several ways to evaluate arguments for validity. * Proofs * Truth Tables * Trees.
Chapter 4 The Composition of Solutions Expressing Solubility M = Molarity = moles solute / liters of solution.
Double click here to add event title Double click here to add event date Double click here to add event time Double click here to add event location.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
M 112 Short Course in Calculus Chapter 1 – Functions and Change Sections 1.7 – Exponential Growth and Decay V. J. Motto.
Chapter 1 Section 2 Review
I can’t wait to see how well I did on my test!. Lesson 2-1 I can make an educated guess based on reasoning I can find counterexamples I can use algebra.
Long Multiplication ÷ ÷ + ÷ ÷ + Using the ‘Grid Method’
If-then statements April 4, What is an if-then statement? One of the postulates we looked at earlier stated: If B is between A and C, then AB +
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Contingent A statement is contingent iff it is neither a logical truth nor a contradiction.
LOGARITHMIC AND EXPONENTIAL EQUATIONS LOGARITHMIC AND EXPONENTIAL EQUATIONS SECTION 4.6.
Chapter 1 Functions and Models Calculus 5e Early Transcendentals Single Variable James Stewart.
IT 210 Week 1 CheckPoint Input Data and Output Process To purchase this material link Input-Data-and-Output-Process.
IT 244 Week 6 DQ 1 To purchase this material link Week-6-DQ-1 For more courses visit our website
(Category, Teacher, Period) Student Name Banneker AHS 2017
Geometry – Prentice Hall (Pearson)
a valid argument with true premises.
A statement is a contradiction
Chapter 6 Section 3.
My Growth in Public Presentation
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Click here for the answer. Click here for the answer.
Click here for the answer. Click here for the answer.
Click here for the answer. Click here for the answer.
Methods for Evaluating Validity
Propositional Calculus: Boolean Algebra and Simplification
PivotTables in Excel (2007)
Correlation Coefficient
Propositional Equivalences
What is the value of -(A>-B) for each of the ways A and B
Review To check an argument with a tree:.
Let us build the tree for the argument Q>-P | P>Q.
Verifying Logical Arguments with Extensible Truth Tables
The Logic of Declarative Statements
Logic Gates Truth Table Challenge
The most important idea in logic: Validity of an argument.
Inverse, Exponential and Logarithmic Functions
Logical Truth To show a statement A is a logic truth (tautology) ...
Mathematics Unit 3: Apples
Ch 10: Basic Logic of Factorial Designs & Interaction Effects
Foundations of Discrete Mathematics
Open Branches Sometimes trees have more than one open branch.
Equivalence We have already introduced the idea of equivalence
6.4 Truth Tables for Arguments
Cell Size and Growth Chapter 10-1 Pg. 241.
APA Review of the Literature
A more complex example: (L&E)>P | L>P
Browse the codebook - to see the list of variables on which you can do statistics select the “Browse codebook in this window” option and then click “Start”
SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.
Presentation transcript:

(Single Sided) Trees We are not going to cover the double sided tree method given in Chapter 11. In my opinion, double sided trees are harder to learn.

Or Follow this link (Single Sided) Trees We are not going to cover the double sided tree method given in Chapter 11. Instead, I will cover Single Sided Trees. They are summarized in Appendix 4 (p. 233) and explained in your course packet in the section called “How to Make a Tree” Or Follow this link

(Single Sided) Trees We are not going to cover the double sided tree method given in Chapter 11. In my opinion it is harder to learn. Instead, I will cover Single Sided Trees. They are summarized in Appendix 4 (p. 233) and explained in your course packet in the section called “How to Make a Tree” Further information is given at www.miami.edu/phi/one-sided-trees or on your Prop Logic CD in the file: ch11a.txt

The truth table method can be very inefficient. (Single Sided) Trees The truth table method can be very inefficient.

The truth table method can be very inefficient. (Single Sided) Trees The truth table method can be very inefficient. Number of variables Number of rows in the table 2 4 3 8 4 16 5 32 6 64 7 128 8 256 9 512 10 1024 Exponential Growth!

the premises are (all) T The Basic Idea Counterexample A row of a table where the premises are (all) T and the conclusion is F.

the premises are (all) T The Basic Idea Counterexample A row of a table where the premises are (all) T and the conclusion is F. P T F T F QT T F F Q>-P | P>Q T F T F T T T Counterexample

The Basic Idea Counterexample Counterexample A row of a table where the premises are (all) T and the conclusion is F. P T F T F QT T F F Q>-P | P>Q T F T F T T T Counterexample If we had known to calculate row 3, we would have needed to do only ¼ of the work.

For more click here The Basic Idea Counterexample Counterexample A row of a table where the premises are (all) T and the conclusion is F. P T F T F QT T F F Q>-P | P>Q T F T F T T T Counterexample The tree method helps us find counterexamples quickly and efficiently. For more click here