BITS Pilani

Pilani Campus
BITS Pilani
Pilani Campus
MODULE: PROPOSITIONAL LOGIC
Natural Deduction: Rules for Conjunction
Sundar B. CS&IS, BITS Pilani 0 11-08-2014
CS/IS F214
Logic in Computer Science
ND: Conjunction
Conjunction refers to the operation AND:


11-08-2014
1 Sundar B. CS&IS, BITS Pilani
1 2
1 & 2
&i
1&2
1
&e1
1&2
2
&e2
ND: Conjunction - Example
Prove the following sequent:
hot & humid, sleepy & dull |-- hot & sleepy
The proof evolves via the following steps:

11-08-2014
2 Sundar B. CS&IS, BITS Pilani
Deduction Explanation
1
hot & humid Premise
2
hot &e1 1
The first &-elimination rule
is applied on premise in
line 1 i.e. hot & humid to
obtain the result hot
ND: Conjunction Example (continued)

11-08-2014
3 Sundar B. CS&IS, BITS Pilani
Deduction Explanation
1
hot & humid Premise
2
hot &e1 1
3
dull & sleepy Premise
4
sleepy &e2 3
The second &-elimination
rule is applied on premise
in line 3 i.e. dull & sleepy to
obtain the result sleepy
ND: Conjunction Example (continued)

11-08-2014
4 Sundar B. CS&IS, BITS Pilani
Deduction Explanation
1
hot & humid Premise
2
hot &e1 1
3
dull & sleepy Premise
4
sleepy &e2 3
5
hot & sleepy &i 2,4
The &-introduction rule is
applied on results in line 2
and 4 to obtain the result
hot & sleepy
Natural Deduction: Proofs
11-08-2014
5 Sundar B. CS&IS, BITS Pilani
Observations (about proofs):
Typically the first step is a premise from the given sequent
and the last step is the conclusion from the given sequent.
Typically the rule applied is
(i) an elimination rule for an operation if
the (desired) result should be devoid of the operation
but one of the premises contains the operation.
(ii) an introduction rule for an operation if
the (desired) result should involve the operation
but the premises may not
Conjunction - Exercises
Prove the following sequents:
english_summer & green_top & fast_bowling,
indian_batsmen_fail
|--
english_summer & fast_bowling & indian_batsmen_fail
p & q, r & t |-- p & q & r & t
11-08-2014
6 Sundar B. CS&IS, BITS Pilani