Name, Symbol, Line citation, Dependency numbers

Name

Symbol

Line Citation

Dependency
Numbers
{a, b}

Conjunction
&I
a, b &I
Introduction
Can be used for any two lines that are true
Conjunction
&E
a &E
{a}
Elimination
Can be used on any binary and connector.
Modus Ponens
MP
a, b MP
{a, b}
a is line of conditional, b is line of antecedent
Rule of
A
A
a
Assumptions
Any formula may be assumed on any line of proof. The line must be
annotated A for assumption. The dependency-number of the assumed
formula is identical with the line number of the line on which it is
assumed
Conditional
CP
a, b &I
{a}
Proof
Assume the antecedent. Derive the consequent. Enter the conditional
on a line along with CP. The line numbers are both those where the
antecedent is assumed and those where the consequent is derived.
Discharge the dependency-number of the antecedent. Pool the remaining
dependency-numbers to complete the line.
Introduction
I
a, b I
{a, b}
Given a pair of conditional on two lines such that the antecedent of
the first is the consequent of the second and the consequent of the
first is the antecedent of the second you may write <-> between the
two formulas, antecedent and consequent, on a new line. The new line
is annotated with the line numbers of both lines used and I. The
dependency-numbers of the new line are all of those of both lines
used.
Elimination
E
a E
{a}
Given a biconditional on a line we may rewrite that formula as the
conjunction of the relevant pair of conditionals on the next line of
proof. The new line is annotated with the line number of the old line
and takes as dependency-numbers all and only those off the old line.
Modus Tollens
MP
a, b MP
{a, b}
Given a conditional on one line and the negation of its consequent on
another, infer the negation of the antecedent. Annotate the new line
with the line numbers of both lines used and MT. The dependencynumbers of the new line are all those of both lines used.
Double Negation- DNI
a DNI
{a}
Introduction
Double NegationElimination

DNE

a DNE

{a}

Disjunction
vI
a vI
{a}
Introduction
Given a formula on a line of proof you may infer the disjunction of
that formula with any other well-formed formula on a new line of
proof. Annotate the new line with the line number of the old line and
vI. The dependency-numbers of the new line are identical with those
of the old line.
Disjunction
vE
a, b, c, d, e vE {a}
Elimination
Lines of citation, First is line of original disjunction, Second is
dependency-number of first disjunct assumed, third is line number of
conclusion derived from first disjunct, fourth is dependency number
of the second disjunct assumer, fifth is line number of the
conclusion derived from the second disjunt.
May infer a conclusion from a disjunction is you can prove to me
first that, assuming the first disjunct, the conclusion follows from
that disjunct and second that, assuming the scond disjunct, the same
reconclusion also follows from that disjunct.
Reduction Ad
RAA
a, b, c, d, e vE {a}
Absurdum
.
&E
&I
MP, elimination
CP conditional proof
I
E
MT Modus Tollens
DNI
DNE
vI
vE
RAA
Theorem Proving
Golden Rule
Primitive Rules vs Derived Rules