Review To check an argument with a tree:.

Slides:



Advertisements
Similar presentations
Logic & Critical Reasoning
Advertisements

3.5 – Analyzing Arguments with Euler Diagrams
Logic & Critical Reasoning
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
Main Connectives The main connective of a sentence is the connective outside of any parentheses.
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.
AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.
What is Logic About? Logic is the study of good and bad Reasoning.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
Truth Trees Intermediate Logic.
CS128 – Discrete Mathematics for Computer Science
Truth Trees.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
1 CA 208 Logic PQ PQPQPQPQPQPQPQPQ
3.3 Rules Negation: ¬¬p implies p Conjunction: p&q implies p, q
Chapter 3 Propositional Logic
Consistency In logic, ‘consistency’ has two meanings.
Validity All UH students are communists. All communists like broccoli. All UH students like broccoli.
Solution of Triangles COSINE RULE. Cosine Rule  2 sides and one included angle given. e.g. b = 10cm, c = 7 cm and  A = 55° or, a = 14cm, b = 10 cm and.
Chapter Six Sentential Logic Truth Trees. 1. The Sentential Logic Truth Tree Method People who developed the truth tree method: J. Hintikka— “model sets”
Deductive vs. Inductive Logic This course is about deductive logic. But it is important to know something about inductive logic.
Question of the Day!  We shared a lot of examples of illogical arguments!  But how do you make a LOGICAL argument? What does your argument need? What.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
Validity and Conditionals There is a relationship between validity of an argument and a corresponding conditional.
Whiteboardmaths.com © 2008 All rights reserved
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
Study Questions for Quiz 1 1. The Concept of Validity (20 points) a. You will be asked to give the two different definitions of validity given in the lecture.
Why Truth Tables? We will learn several ways to evaluate arguments for validity. * Proofs * Truth Tables * Trees.
Formal Proofs and Boolean Logic Chapter 6 Language, Proof and Logic.
Chapter Twelve Predicate Logic Truth Trees. 1. Introductory Remarks The trees for sentential logic give us decidability—there is a mechanical decision.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Draw a 9cm line and label the ends A and B. This is the line AB.
Study Questions for Quiz 5 The exam has four parts: 1. (32 points) Truth Tables 2. (48 points) Truth Trees 3. (10 points) Review of Highly Recommended.
Equivalence Class Testing Use the mathematical concept of partitioning into equivalence classes to generate test cases for Functional (Black-box) testing.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Contingent A statement is contingent iff it is neither a logical truth nor a contradiction.
a valid argument with true premises.
Discrete Mathematics Logic.
{P} ⊦ Q if and only if {P} ╞ Q
Click here for the answer. Click here for the answer.
Click here for the answer. Click here for the answer.
Methods of Proof A mathematical theorem is usually of the form pq
Click here for the answer. Click here for the answer.
Constructing a triangle
Symbolization Review.
Methods for Evaluating Validity
Evaluating truth tables
Chapter 5.1 Write Indirect Proofs
Truth Trees.
CS 270 Math Foundations of CS
Constructing a Triangle
&In and &Out The rules for & are very simple. A A&B A&B
Propositional Logic.
Let us build the tree for the argument Q>-P | P>Q.
Negation Rule Strategies
8.2 Use Properties of Parallelograms
Strategy Review Here is a summary of all the
Discrete Mathematics Logic.
5 Categorical Syllogisms
The most important idea in logic: Validity of an argument.
Mathematics Unit 8: Triangles
Open Branches Sometimes trees have more than one open branch.
Refresh: Click Here.
A very difficult problem There is nothing to do, so try -Out.
SUMMARY Logic and Reasoning.
A more complex example: (L&E)>P | L>P
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Summary of the Rules A>B -A B -(A>B) A -B --A A AvB A B
Presentation transcript:

Review To check an argument with a tree:

Review To check an argument with a tree: 1. Write down the premises and the negation of the conclusion.

Review To check an argument with a tree: 1. Write down the premises and the negation of the conclusion. 2. Apply tree rules to every complex sentence.

Review To check an argument with a tree: 1. Write down the premises and the negation of the conclusion. 2. Apply tree rules to every complex sentence. 3. Mark the branches that contain contradictions as closed (*).

Review To check an argument with a tree: 1. Write down the premises and the negation of the conclusion. 2. Apply tree rules to every complex sentence. 3. Mark the branches that contain contradictions as closed (*). 4. If all branches are CLOSED, the argument is VALID. If a branch is OPEN, the argument is INVALID.

Another Example (P&Q)>R, P | Q>R

Another Example (P&Q)>R P -(Q>R) (P&Q)>R, P | Q>R

Another Example (P&Q)>R P -(Q>R) (P&Q)>R, P | Q>R

Another Example The (->) Rule: -(A>B) A -B (P&Q)>R P (P&Q)>R, P | Q>R

Another Example The (->) Rule: -(A>B) A -B (P&Q)>R P (P&Q)>R, P | Q>R 1

Another Example (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R 1

Another Example (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R The (>) Rule: A>B -A B 1

Another Example 2 (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R The (>) Rule: A>B -A B 1 -(P&Q) R

Another Example 2 (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R 1 *

Another Example 2 (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R 1 *

Another Example 2 (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R 1 The (-&) Rule: -(A&B) -A -B -(P&Q) R *

Another Example 2 (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R 1 The (-&) Rule: -(A&B) -A -B -(P&Q) R * -(A&B) = -Av-B

Another Example 2 (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R 1 The (-&) Rule: -(A&B) -A -B -(P&Q) R * 3 -P -Q -(A&B) = -Av-B

Another Example 2 (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R 1 * 3 -P -Q

Another Example 2 (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R 1 * 3 -P -Q *

Another Example 2 (P&Q)>R P -(Q>R) Q -R (P&Q)>R, P | Q>R 1 * 3 -P -Q * *

For more click here Another Example 2 (P&Q)>R P -(Q>R) Q -R VALID 1 -(P&Q) R * 3 -P -Q * * For more click here

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.