rules of
ch 15-16
ch 17-19
ch 21-22
100

if p then q

p

therefore q

Modus Ponens

100

a special rule in a formal proof which allows us to assume the antecedent of a conditional and, once we deduce that consequent, to conclude the entire conditional

Conditional proof

100

a path on a truth tree for which a contradiction has been found 

closed branch

200

if p then q

not q

therefore not p

modus tollens

200

a special rule in a formal proof which allows us to assume the negation of a proposition, deduce a self-contradiction, then conclude the original proposition

Reductio ad Absurdum

200

simple propositions or negations of simple propositions

literals

300

if p then q

if q then r

therefore if p then r

hypothetical syllogism

300

1. understand what a proof is: use previous steps as premises in a rule to deduce the conclusion

2. keep the goal in mind: work toward conclusion

3. say steps out loud to help recognize a rule

4. when stuck, try Absorption or Addition

5. check for unused steps; usually each step is used once

5 hints for developing formal proofs

300

p if and only if (p v p)

p if and only if (p . p)

(a conjunction or disjunction of a proposition with itself can be simplified to just the proposition)

tautology

300

a path on a truth tree which includes no contradiction

Open branch

400

p or q

not p

therefore q

disjunctive syllogism

400

forms of equivalent statements, which may replace each other wherever they occur (even if part of a larger proposition) and work from left to right AND right to left

Rules of replacement

400

a diagram which shows a set of propositions being decomposed into their literals in order to look for contradictions

Truth Tree

500

(if p then q) AND (if r then s)

p v r

therefore q v s

Constructive dilemma

500

1. Try working backwards from the conclusion, or forward and backward at the same time to meet in the middle

2. try implication and/or DeMorgans to change from conditional to disjunction to conjunction or reverse

3. certain rules work more often with certain types of conclusions

3 hints for solving formal proofs

500

to break down compound propositions into simple propositions (or their negation) which are called literals

decompose