Introduction Proof Rules

Natural Deduction

Dr. E. Mujuni

April 21, 2022

Introduction Proof Rules

Introduction

Natural deduction is a system for reasoning about propositions.

In logic and proof theory, natural deduction is a kind of proof

calculus in which logical reasoning is expressed by inference
rules closely related to the ”natural” way of reasoning.

In natural deduction, a proposition is deduced from a collection of

premises by applying inference rules repeatedly
Introduction Proof Rules

Introduction

Recall:
Definition
An argument is an expression of the form:

φ1 , φ2 , . . . , φn ` ψ

The φ’s are called premises and ψ the conclusion.

The argument is valid if there is a proof for it.

A proof is sequence of applications proof rules to the premises

that eventually obtain the conclusion.
Introduction Proof Rules

Proof rules for conjunction

and-introduction
φ ψ
∧i
φ∧ψ
and-elimination (two varients)

φ∧ψ φ∧ψ
∧e1 ∧e2
φ ψ
Introduction Proof Rules

Example
Prove that
p ∧ q, r ` q ∧ r

Solution
1 p∧q premise
2. r Premise
3. q ∧e2 , 1
4. q∧r ∧i 3, 2
Introduction Proof Rules

Proof rules for double negation

introduction
φ
¬¬i
¬¬φ
elimination
¬¬φ
¬¬e
φ
Introduction Proof Rules

Example
Prove that p, ¬¬(q ∧ r ) ` ¬¬p ∧ r

Solution
1. p premises
2. ¬¬(q ∧ r ) premise
3. ¬¬p ¬¬i 1
4. p∧r ¬¬e 2
5. r ∧e2 , 4
6. ¬¬p ∧ r ∧i , 3, 5
Introduction Proof Rules

Example
Prove (p ∧ q) ∧ r , s ∧ r ` q ∧ s

Solution
1. (p ∧ q) ∧ r premise
2. s∧t premise
3. p∧q ∧e1 , 1
4. q ∧e2, 3
5. s ∧e1 , 2
6. q∧s ∧i , 4, 5
Introduction Proof Rules

Implies-elimination, AKA Modus Ponens

φ, φ → ψ
→e .
ψ
Introduction Proof Rules

Modus Tollen

φ → ψ, ¬φ
MT
¬φ

Example
Prove ¬p → q, ¬q ` p

Solution
1. ¬p → q Premise
2. ¬q Premise
3. ¬¬p MT 1, 2
4. p ¬¬e 3
Introduction Proof Rules

Implies-Introduction

φ
..
.
ψ
→i
φ→ψ
The rule state that by making a temporary assumption on φ and the
proving ψ we can prove φ → ψ.

Example
Prove p → q ` ¬q → ¬p.

Solution
1. p→q premise
2. ¬q assumption
3. ¬p MT 1, 2
4. ¬q → ¬p →i 2 − 3
Introduction Proof Rules

Example
Prove ¬q → ¬p ` p → q

Solution
1. ¬q → ¬p premise
2. p assumption
3. ¬¬p ¬¬i 2
4. ¬¬q MT 1, 3
5. q ¬¬e 4
6. p→q →i 2 − 5
Introduction Proof Rules

Example
Prove ` (q → r ) → ((¬q → ¬p) → (p → r ))

Solution
1. q→r assumption
2. ¬q → ¬p assumption
3. p assumption
4. ¬¬p ¬¬i 3
5. ¬¬q MT 2, 4
6. q ¬¬e 5
7. r →e 1, 6
8 p→r →i 3 − 7
9. (¬q → ¬p) → (p → r ) →i 2 − 8
10. (q → r ) → ((¬q → ¬p) → (p → r )) →i 1 − 9
Introduction Proof Rules

Example
Prove p ∧ q → r ` p → (q → r )

Solution
1. p∧q →r premise
2. p assumption
3. q assumption
4. p∧q ∧i 2, 3
5. r →e 1, 4
6. q→r →i 3 − 5
7. p → (q → r ) →i 2 − 6
Introduction Proof Rules

Example
Prove p → q ` p ∧ r → q ∧ r .

Solution
1. p→q premise
2. p∧r assumption
3. p ∧e1 2
4. r ∧e2 2
5. q →e 1, 3
6. q∧r ∧i 5, 4
7. p∧r →q∧r →i 2 − 6
Introduction Proof Rules

Exercise
With examples, write short notes on the following

1 Proof rules for disjunction

2 Contradictions

3 Proof rules for negation-introduction

Examples on the Semantic Tableaux method