Higher College of Technology

Computer and Information Science

Faculty
Exercise 1.3

1. Show that -(-p) and p are logically equivalent.

p ￢p ￢ (￢p)

t f T
f t F

b) Show that -(p ∧ q) and - p ∧ - q are NOT logically equivalent

p q -p -q p∧q -(p ∧ q) -p∧-q

t t f f t f f
t f f t f t f
f t t f f t f
f f t t f t t

2. Use truth tables to verify the commutative law.

a) p v q ≡ q v p.

p q q∨p p ∨q
T t f T
t f f T
f t T T
f f f F

b)p Λ q ≡ q Λ p.

p q qΛp p Λq
T T T T
T F F F
F T F F
F F F F

pg. 1
 3. Use truth tables to verify the associative law
a) (p v q) v r ≡ p v (qv r).

p q pvq
t t t
t f t
f t t
f f f

b) (p 1tq) A r s p A(q ,. ,).

4. Show that each of these conditional statements is a tautology by using truth tables.

p q p∧q (p ∧ q) → p
t t t t
t f f t
f t f t
f f f t

b) p → (p v q)

p q p∨q p → (p ∨ q)
t t t t
t f t t
f t t t
f f f t

pg. 2
 p q ￢p (p → q) ￢p → (p → q)

5. Is p ^ -p a Tautology OR a Contradiction?

p ￢p p ∧ ￢p

T f f
F t f

6. Is (p ∧~q) ∧ (~p ∨ q) a Tautology OR a Contradiction?

p q ￢p ￢q (p ∧~q) (￢p ∨ q) (p ∧￢q) ∧ (￢p ∨ q)

t t f f f t f
t f f t t f f
f t t f f t f
f f t t f t f

pg. 3
Logic math symbols table

Symbol Symbol Name Meaning / definition Example

⋅ and and x ⋅ y

^ caret / circumflex and x ^ y

& ampersand and x & y

+ plus or x + y

∨ reversed caret or x ∨ y

| vertical line or x | y

x' single quote not - negation x'

x bar not - negation x

¬ not not - negation ¬ x

! exclamation mark not - negation ! x

⊕ circled plus / oplus exclusive or - xor x ⊕ y

~ tilde negation ~ x

⇒ implies    

⇔ equivalent if and only if (iff)  

↔ equivalent if and only if (iff)  

∀ for all    

pg. 4
 ∃ there exists    

∄ there does not exists    

∴ therefore    

∵ because / since    

pg. 5