DERIVED SENTENCE LOGIC RULES FOR NATURAL DEDUCTION

Argument by Cases Biconditional Biconditional

Introduction Elimination
. -
XvY
PRIMITIVE SENTENCE L O G ~ CRULES FOR NATURAL DEDUCTION'
Conjunction
Introduction
Conjunction
Elimination !l
E
Disjunction Disjunction
Introduction Elimination

Disjunction Elimination Reductio Ad Absurdum

Conditional Conditional
Introduction Elimination @ vE

Weakening Denying the Consequent

Biconditional Biconditional
Introduction Elimination @ Dc
Negation Introduction Contradiction

Negation Negation
pl
Introduction Elimination @ CD

De Morgan's Rules
-(XvY) and -X&-Y are mutually derivable (DM)
- -(X&Y) and -XV-Y are mutually derivable (DM)

Reiteration: I f a sentence occurs, either as a premise or as a conclusion in a Contraposition

derivation, that sentence may be copied (reiterated) in any of that derivation's X>Y and -Y>-X are mutually derivable (CP)
LOWER subderivations, or lower down in the same derivation. -X>Y and -Y>X are mutually derivable (CP)
*
X>-Y and Y>-X are mutually derivable (CP)
Conditional Rules
X>Y and -XVY are mutually derivable (C)
-(X>Y) and X&-Y are mutually derivable (C)
 PRIMITIVE PREDICATE LOGIC RULES FOR NATURAL DEDUCTION

Univd Universal
Introduction Elimination
SENTENCE LOGIC TRUTH TREE RULES
1-1 where 8 occurs arbitrarily and
.
(VU)(. .u. . .) is the universal Rule & Rule -& Rule v Rule -v
VI generalization of (. . A. . .)

Existential Existential Rule - 3 Rule = Rule -=

Introduction Elimination
p - 1 1-

Where (3u)(. . .u; . .) is an

.
(3u)(. . .u, .)

Rule
00
--
Y

existential generalization
of (. . .a. . .) 3E
Where (. . .a. . .) is a
substitution instance of
(3u)(. . .u.. .) and a is
isolated in the PREDICATE LOGIC TRUTH TREE RULES
subderivation Rule V Rule 3 Rule -V Rule -3
DERIVED RULES FOR NEGATED QUANTIFIERS pxz-l
(with21 names, s a NEW NAME
s, on the branch)
NATURAL DEDUCTION RULES FOR IDENTITY AND FUNCTION
SYMBOLS
- - --

Function symbols:
Treat all constant
terms alike in
@ E a p p l ~ h 3 and
3 I. ADD~V V I and
*
3 E o x y io names.

TRUTH TREE RULES FOR IDENTITY AND FUNCTION SYMBOIS

Rule #: Close any branch on which s # s appears.
Rule = : When s = t appears on 'a branch, substitute s and t for each other
wherever possible, without checking the resulting lines.

For function symbols: Instantiate all universally quantified sentences with all con-
stant terms on the branch. In existentially quantified sentences use only one NEW
NAME;