natural deduction (original) (raw)

Typically the rules consist of one pair for each connective, one of which allows the introduction of that symbol and the other its elimination.

To give one example, the proof rules →I and →E are:

and