LOGIC !

LECTURE N10

Propositional Logic Again

Google processes language according to!
propositional logic. !
!
!
Find: Poem by Edgar Poe which contains the name!
Annabel or Bella or Lee.!
!
Poem !
AND !
By Edgar Poe!
AND!
(Contains name Annabel OR Contains name Bella !
OR Contains name Lee).!
!
!
!
 Google processes language according to!
propositional logic. !
!
!
Find: Poem by Edgar Poe which contains the name!
Annabel or Bella or Lee.!
!
Poem !
AND !
By Edgar Poe!
AND!
Try it Yourself! (Contains name Annabel OR Contains name Bella !
OR Contains name Lee).!
!
!
!
Axioms of Propositional logic

! !
! (Φ ∧ Ψ) ∨ Θ ! ≡ (Φ ∨ Θ) ∧ (Ψ ∨ Θ)!
! (Φ ∨ Ψ) ∧ Θ !≡ (Φ ∧ Θ) ∨ (Ψ ∧ Θ)!
! !
! ¬(Φ ∨ Ψ) ! ≡ ¬Φ ∧ ¬Ψ!
¬(Φ ∧ Ψ) ! ≡ ¬Φ ∨ ¬Ψ!
! !
! Φ⊃Ψ! ≡ ¬Φ ∨ Ψ!
! !
! (Φ ≡ Ψ) ! ≡ (Φ ⊃ Ψ) ∧ (Ψ ⊃ Φ)!
! !
! ¬¬Φ ! ≡Φ
Axioms should be necessarily true i.e. tautologies

! !
! (Φ ∧ Ψ) ∨ Θ ! ≡ (Φ ∨ Θ) ∧ (Ψ ∨ Θ)!
! (Φ ∨ Ψ) ∧ Θ !≡ (Φ ∧ Θ) ∨ (Ψ ∧ Θ)!
! !
! ¬(Φ ∨ Ψ) ! ≡ ¬Φ ∧ ¬Ψ!
¬(Φ ∧ Ψ) ! ≡ ¬Φ ∨ ¬Ψ!
! !
! Φ⊃Ψ! ≡ ¬Φ ∨ Ψ!
! !
! (Φ ≡ Ψ) ! ≡ (Φ ⊃ Ψ) ∧ (Ψ ⊃ Φ)!
! !
! ¬¬Φ ! ≡Φ
INFERENCE RULES

Every inference rule consists of premises!

!
A1, A2, A3,…An!
!
And conclusion!
!
C!
!
An inference A1, A2,…An => C!
is valid if C is true whenever ALL premises A1, A2,A3 .. and An are true.!
!
In other words if it is not possible for C to be true when all premises !
A1 and A2 and A3 .. and An are true.
CHECKING INFERENCE RULES BY TRUTH TABLES

A ⊃ ¬B!
C ⊃ B!
A!
-----------!
¬C
A! B C ¬B! C ⊃ B! A ⊃ ¬B! ¬C!
"#$#%&'. "#$#%&'. "#$#%&'. (#$#)*+,
1 1 1 0 1 0 0
1 1 0 0 1 0 1
1 0 1 1 0 1 0
1 0 0 1 1 1 1
0 1 1 0 1 1 0
0 1 0 0 1 1 1
0 0 1 1 0 1 0
0 0 0 1 1 1 1
VALID INFERENCE RULES

P⊃Q! P⊃Q ! P⊃Q ! P∨Q !

P! ¬Q! Q ⊃ R! ¬P!
--------! -------- ! --------! ------------ !
Q! ¬P! P ⊃ R! Q!
! ! ! !
1) Modus !
2) Modus tollens 3) Transitivity of 4) Cut rule
ponens implication
VALID INFERENCE RULES

(P ⊃ Q) ∧ (R ⊃ S)! P ∧ Q! P! P!
P ∨ R! -------- ! Q! -------- !
--------! P! -------- ! P ∨ Q!
Q ∨ S! ! P ∧ Q! !
! ! ! !
5) Constructive 6) Conjunction ! 7) Conjunction 8) Disjunction
dilemma introduction! rule
rule
VALID INFERENCE RULES

1. A ⊃ ¬B!
2. C ⊃ B!
3. A !! / ¬C
VALID INFERENCE RULES

1. A ⊃ ¬B!
2. C ⊃ B!
3. A !! / ¬C!
4. ¬B ! 1, 3, Modus Ponens
VALID INFERENCE RULES

1. A ⊃ ¬B!
2. C ⊃ B!
3. A !! / ¬C!
4. ¬B ! 1, 3, Modus Ponens!
5. ¬C ! 2, 4, Modus Tollens
INFERENCES BY TAUTOLOGIES

¬(P ∧ Q) ≡ ¬P ∨ ¬Q P ≡ ¬¬P !
¬(P ∨ Q) ≡ ¬P ∧ ¬Q 12) Double negation law!
9) De Morgan laws! !
! !
(P ∧ Q) ≡ (Q ∧ P) [P ∧ (Q ∨ R)] ≡ [(P ∧ Q) ∨ (P ∧ R)]!
(P ∨ Q) ≡ (Q ∨ P) [P ∨ (Q ∧ R)] ≡ [(P ∨ Q) ∧ (P ∨ R)]!
10) Commutativity laws! 13) Distributivity laws!
! !
[(P ∧ Q) ∧ R] ≡ [P ∧ (Q ∧ R)]
[(P ∨ Q) ∨ R] ≡ [P ∨ (Q ∨ R)]
11) Associativity laws
INFERENCES BY TAUTOLOGIES

(P ⊃ Q) ≡ (¬Q ⊃ ¬P) [(P ∧ Q) ⊃ R] ≡ [P ⊃ (Q ⊃ R)] !

14) Contraposition ! 17) Transformation rule !
! !
(P ⊃ Q) ≡ (¬P ∨ Q) P ≡ (P ∨ P)!
15) Elimination of implication! P ≡ (P ∧ P)!
! 18) Repetition !
(P ≡ Q) ≡ [(P ⊃ Q) ∧ (Q ⊃ P)] !
16) Elimination of Equivalence !
INFERENCES BY TAUTOLOGIES

1. K ⊃ L!
2. (M ⊃ N) ∧ S!
3. N ⊃ T!
4. K ∨ M ! ! /L∨T
INFERENCES BY TAUTOLOGIES

1. K ⊃ L!
2. (M ⊃ N) ∧ S!
3. N ⊃ T!
4. K ∨ M ! ! ! / L ∨ T!
5. M ⊃ N ! ! ! 2, conjunction
INFERENCES BY TAUTOLOGIES

1. K ⊃ L!
2. (M ⊃ N) ∧ S!
3. N ⊃ T!
4. K ∨ M ! ! ! / L ∨ T!
5. M ⊃ N ! ! ! 2, conjunction!
6. M ⊃ T ! ! ! 3, 5, transitivity of implication
INFERENCES BY TAUTOLOGIES

1. K ⊃ L!
2. (M ⊃ N) ∧ S!
3. N ⊃ T!
4. K ∨ M ! ! ! / L ∨ T!
5. M ⊃ N ! ! ! 2, conjunction!
6. M ⊃ T ! ! ! 3, 5, transitivity of implication!
7. (K ⊃ L) ∧ (M ⊃ T) ! 1, 6, Conjunction intro.
INFERENCES BY TAUTOLOGIES

1. K ⊃ L!
2. (M ⊃ N) ∧ S!
3. N ⊃ T!
4. K ∨ M ! ! ! / L ∨ T!
5. M ⊃ N ! ! ! 2, conjunction!
6. M ⊃ T ! ! ! 3, 5, transitivity of implication!
7. (K ⊃ L) ∧ (M ⊃ T) ! 1, 6, Conjunction intro.!
8. L ∨ T ! ! ! 4, 7, Constructive dilemma