SESSION 5

Duality Principle
If s is any formula involving in logical connectives then S* is the logical
expression which is obtained from s by replacing v by ^ and ^ by v , T by F & F
by then S* is also tautology.
S* is called the Dual of S. We note if S is a tautology.
Ex:
If S:(PvQ) P^Q then
S*:(P ^Q) PVQ
Theorem
If H1, H2,..Hn & P Q, then prove
That H1,H2,.. Hn imply P Q.
Proof:
Given that

H1, H2.,..Hn & P Q.

This means that (H1^H2^H3^ .^Hn) ^P Q

i.e , (H1^H2^H3^ .^Hn)^P Q is a tautology (1)
To prove :
(H1^H2^H3^ .^Hn) P Q
i.e We have to prove that,
(H1^H2^H3^ .^Hn) ( P Q) is a tautology.

We know that,
A (B C) (A ^ B) C
since (A ^ B) C is a tautology then
A (B C) is also a tautology

(H1^H2^H3^ .^Hn)
(H1^H2^H3^ .^Hn)

(P Q) is also a tautology [ from (1) ]

(P Q)

Hence proved.
Functionally Complete set of connectives
Defintion : A set of connection is said to be functionally complete if any
formula can be written as an equivalent formula containing only these
connectives.