Homework 1 ‫ ﻋﻠﻲ ﺳﺎﻣﻲ ﻋﺑد اﻻﻣﯾر‬:‫اﻻﺳم‬

Q1 \ prove that without truth table.

A- ∼ (p ∨∼ q) =∼ p ∧ q
Proof:
∼p ∧ q =∼ p ∧ q

B- p ↔ q = ∼p ↔ ∼q
Proof:
R.H.S = ∼p ↔ ∼q
= ∼ (p → q) ∧ ∼ (q → p)
= (∼p → ∼q) ∧ (∼q → ∼p)
= (p → q) ∧ (q → p)
=p↔q
R.H.S = L.H.S

C- p → q = [(p ∧ ∼q) → (r ∧∼ r)]

Proof:
R.H.S = (p ∧ ∼q) → (r ∧∼ r)
= (∼ (p ∧ ∼q) ∨ (r ∧∼ r))
= ((∼p ∨ ∼∼q) ∨ 0)
= (∼p ∨ q)
=p→q
L.H.S = R.H.S

D- ∼ (p → q) = (p ∨ q) ∧∼ p
Proof:
L.H.S = ∼ (p → q)
= ∼ (∼p ∨ q)
= (p ∧ ∼q)
R.H.S = (p ∨ q) ∧∼ p
= (∼p ∧ p) ∨ (∼p ∧ q)
= 0 ∨ (∼p ∧ q)
= (∼p ∧ q)
R.H.S ≠ L.H.S
E- ∼ (p → q) = p ∧∼ q
Proof:
R.H.S = ∼ ()
= ∼ (∼p ∨ q)
= p ∧ ∼q
R.H.S = L.H.S

Q2 \ Show p → q = ~p ∨ q by using the truth table

Answer:

p q p→q ∼p ∼p → q

T T T F T

T F F F F

F T T T T

F F T T T

p → q = ~p ∨ q