The Tree Method - Introductory Logic - Lecture Notes | PHIL 102, Study notes of Reasoning

Material Type: Notes; Class: Introductory Logic; Subject: Philosophy; University: University of Illinois - Chicago; Term: Summer 2005;

Typology: Study notes

Pre 2010

Uploaded on 07/29/2009

koofers-user-nz2-1
koofers-user-nz2-1 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Handout, Phil 102
Craig Fox
Class #12, 7/7/05
1 The Tree Method
pqp·qpqpq
@@
@
@@
@
@@
@
pqppqpp
qqq
(pq)(p·q)(pq)(pq)∼∼ p
@@
@
@@
@
ppqp p qp
qqqp
If both pand poccur in the same path, then an ‘X’ is placed under that path, and it is closed.
Each open path in the tree represents a possible way of making everything above it true.
When testing an argument for validity, we start the tree with the premises and the negation of
the conclusion. (We’re seeing if this set is consistent: think of the tree method as a “consistency
machine”.)
If all paths close, then the argument is valid. (I.e., there is no way to make the premises true
while making the negation of the conclusion true.)
If there is at least one path open, then the argument is invalid. The path identifies a coun-
terexample.
1

Partial preview of the text

Download The Tree Method - Introductory Logic - Lecture Notes | PHIL 102 and more Study notes Reasoning in PDF only on Docsity!

Handout, Phil 102

Craig Fox

Class #12, 7/7/

1 The Tree Method

p ∨ q p · q p ⊃ q p ≡ q

@ @ @

@ @ @

@ @ @ p q p ∼ p q p ∼ p q q ∼ q

∼ (p ∨ q) ∼ (p · q) ∼ (p ⊃ q) ∼ (p ≡ q) ∼∼ p

@ @ @

@ @ @ ∼ p ∼ p ∼ q p p q p ∼ q ∼ q ∼ q ∼ p

If both p and ∼ p occur in the same path, then an ‘X’ is placed under that path, and it is closed.

  • Each open path in the tree represents a possible way of making everything above it true.
  • When testing an argument for validity, we start the tree with the premises and the negation of the conclusion. (We’re seeing if this set is consistent: think of the tree method as a “consistency machine”.)
  • If all paths close, then the argument is valid. (I.e., there is no way to make the premises true while making the negation of the conclusion true.)
  • If there is at least one path open, then the argument is invalid. The path identifies a coun- terexample.