Thakur College of Science and Commerce

SYJC-SCI Subject :

Topic : logic

CH No :1 Activity Sheet No :1

With out using truth tables, show that

i. 𝑝 ∧ (𝑞 ∨ −𝑝) = 𝑝 ∧ 𝑞

ii. (𝑝 ∧ 𝑞) ∨ (−𝑝 ∧ 𝑞) ∨ (−𝑞 ∧ 𝑟) = 𝑞 ∨ 𝑟

Solution:

(!) LHS = 𝑝 ∧ (𝑞 ∨ −𝑝)

=( )∨( )(Distributive law)

= (𝑝 ∧ 𝑞) ∪ 𝐹 ( LAW)

= −−−−−−−− ((Identity law)

(II). L. HS: = (𝑝 ∧ 𝑞) ∨ (−𝑝 ∧ 𝑞) ∨ (−𝑞 ∧ 𝑡)

= [(𝑝 ∨ −−) ∧ 𝑞] ∨ (− −∧ −) (Associative and distributive law)

= (− −∧ 𝑞) ∪ (− −∧ 𝑟) (Complement law)

= 𝑞 ∨ (−𝑞 ∧ 𝑟) ( -------------------law)

≡ (− − − − − − − ) ∧ ( − − − − − − − − −− ) (Distributive law)

= T ∧ (𝑞 ∨ r) (--------------law)

= 𝑞 ∨ r ( ---------------LAW)

DRILL QUESTIONS

Q1 Write the converse and contrapositive of the statement -

"If two triangles are congruent, then their areas are equal".

Q 2Without using truth table show that : ∼ (𝑝 ∨ 𝑞) ∨ (∼ 𝑝 ∧ 𝑞) ≡∼ 𝑝

1
 Thakur College of Science and Commerce

SYJC-SCI Subject :

Topic : LOGIC

CH No :1 Activity Sheet No :2

Form the negations of the following statements by giving justification.

(1). (𝑝 ∧ 𝑞) → (𝑝 ∨ 𝑟)
Solution:

1. LHS = ---------------------------

= --------------------------- (negation of inplicition)

= ---------------------------------------------(Negation of disjunction)

= --------------------------------------------- (Negation of Negation)

(2) WRITE THE TRUTH TABLE FOR [(𝑝 → 𝑞) ∧ 𝑞] → 𝑝

SOLUTION

Here are two statements and three connectives.

∴ There are 2 × 2 = 4 rows and 2 + 3 = 5 columns in the truth table.

𝑝 𝑞 𝑝→𝑞 (𝑝 → 𝑞) ∧ 𝑞 [(𝑝 → 𝑞) ∧ 𝑞] → 𝑝

𝑇 𝑇 𝑇

𝑇 𝐹 𝐹

𝐹 𝑇 𝑇

𝐹 T T

2
 (3)Express
Express the following circuit in the symbolic form of logic

The symbolic form of the given circuit is:

[𝑝 ∧ (∼ 𝑞 ∨ 𝑟)] ∨ (∼ 𝑞 ∧∼ 𝑟)

SOLUTION
Let p: the switch 𝑆 is closed.

q: the switch 𝑆 is closed.

𝑟 : the switch 𝑆 is closed.

∼ 𝑝 : the switch 𝑆 is closed or the switch 𝑆 is open.

∼ 𝑞 : the switch 𝑆 is closed or the switch 𝑆 is open.

∼ 𝑟 : the switch 𝑆 is closed or the switch 𝑆 is open.

I: the lamp L is on.

3
Input-Output Table

[𝑝 ∧ (∼ 𝑞 ∨ 𝑟)]
𝑝 𝑞 𝑟 ∼𝑞 ∼𝑟 ∼𝑞∨𝑟 𝑝 ∧ (∼ 𝑞 ∨ 𝑟) ∼ 𝑞 ∧∼ 𝑟
∨ (∼ 𝑞 ∧∼ 𝑟)

1 1 1 0 1 0

1 1 0 0 0 0

1 0 1 1 0

0 0 1 1 1

0 1 0 1 0

0 0 0 1 0 0

0 1 1 1 1

DRILL QUESTIONS

Q1 Examine whether the following logical statement pattern is tautology, contradiction or

contingency. [(𝑝 → 𝑞) ∧ 𝑞] → 𝑝

Q2 If 𝑝, 𝑞, 𝑟 are the statements with truth values 𝑇, 𝐹, 𝑇, respectively then find the truth
value of (𝑟 ∧ 𝑞) ↔∼ 𝑝