Scribd
Upload
13 views2 pages

11 - Mathematical Logic

Uploaded by

Vedu A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views2 pages

11 - Mathematical Logic

Uploaded by

Vedu A
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

pSHRI SADGURU GANGAGEER MAHARAJ SCIENCE, GAUTAM ARTS

AND SANJIVANI COMMERCE COLLEGE, KOPARGAON

Mathematics Paper-I

PRACTICAL – I

MATHEMATICAL LOGIC

Q1. Using truth table prove that ~(𝑝 ↔ 𝑞) ≡ (𝑝 ∧∼ 𝑞) ∨ (𝑞 ∧∼ 𝑝).


Solution:
I II III IV V VI VII VIII IX
𝑝 𝑞 ∼𝑝 ∼𝑞 𝑝↔𝑞 ~(𝑝 ↔ 𝑞) 𝑝 ∧∼ 𝑞 𝑞 ∧∼ 𝑝 (𝑝 ∧∼ 𝑞) ∨ (𝑞 ∧∼ 𝑝)
𝑇 𝑇 𝐹 𝐹 𝑇 𝐹 𝐹 𝐹 𝐹
𝑇 𝐹 𝐹 𝑇 𝐹 𝑇 𝑇 𝐹 𝑇
𝐹 𝑇 𝑇 𝐹 𝐹 𝑇 𝐹 𝑇 𝑇
𝐹 𝐹 𝑇 𝑇 𝑇 𝐹 𝐹 𝐹 𝐹
From column (VI) and (IX) we conclude that
~(𝑝 ↔ 𝑞) ≡ (𝑝 ∧∼ 𝑞) ∨ (𝑞 ∧∼ 𝑝)

Q2. Using truth table prove that (𝑝 ∧ 𝑞) ∨ 𝑟 ≡ (𝑝 ∨ 𝑟) ∧ (𝑞 ∨ 𝑟)


Solution:
I II III IV V VI VII VIII
𝑝 𝑞 𝑟 𝑝∧𝑞 (𝑝 ∧ 𝑞) ∨ 𝑟 𝑝∨𝑟 𝑞∨𝑟 (𝑝 ∨ 𝑟) ∧ (𝑞 ∨ 𝑟)
𝑇 𝑇 𝑇 𝑇 𝑇 𝑇 𝑇 𝑇
𝑇 𝑇 𝐹 𝑇 𝑇 𝑇 𝑇 𝑇
𝑇 𝐹 𝑇 𝐹 𝑇 𝑇 𝑇 𝑇
𝑇 𝐹 𝐹 𝐹 𝐹 𝑇 𝐹 𝐹
𝐹 𝑇 𝑇 𝐹 𝑇 𝑇 𝑇 𝑇
𝐹 𝑇 𝐹 𝐹 𝐹 𝐹 𝑇 𝐹
𝐹 𝐹 𝑇 𝐹 𝑇 𝑇 𝑇 𝑇
𝐹 𝐹 𝐹 𝐹 𝐹 𝐹 𝐹 𝐹
From column (IV) and (VI) we conclude that
(𝑝 ∧ 𝑞) ∨ 𝑟 ≡ (𝑝 ∨ 𝑟) ∧ (𝑞 ∨ 𝑟)

Q3. Without using truth table prove that {[(𝑝 ∨ 𝑞) ∧∼ 𝑝] →∼ 𝑞} ≡ 𝑞 → 𝑝


Solution:
LHS = {[(𝑝 ∨ 𝑞) ∧∼ 𝑝] →∼ 𝑞}
≡ [(𝑝 ∨ 𝑞) ∧∼ 𝑝] ∨∼ 𝑞 ……………(conditional Law)
≡ [∼ (𝑝 ∨ 𝑞) ∨ 𝑝] ∨∼ 𝑞 ……………(De-Morgans Law)
≡ [(∼ 𝑝 ∧∼ 𝑞) ∨ 𝑝] ∨∼ 𝑞 ……………(De-Morgans Law)
≡ [(∼ 𝑝 ∨ 𝑝) ∧ (∼ 𝑞 ∨ 𝑝)] ∨∼ 𝑞 ……………(Associative Law)
≡ [𝑡 ∧ (∼ 𝑞 ∨ 𝑝)] ∨∼ 𝑞 ……………(Complement Law)
≡ (∼ 𝑞 ∨ 𝑝) ∨∼ 𝑞 ……………(Identitty Law)
≡ ∼ 𝑞 ∨ 𝑝 ∨∼ 𝑞
≡∼𝑞∨𝑝 ……………(Identitty Law)
≡ 𝑞→𝑝
= 𝑅𝐻𝑆

Q4. Give an alternative arrangement for the following circuit, so that the new circuit has
minimum switches.

Solution: let p: The switch 𝑆1


q: The switch 𝑆2
The symbolic form is (p∧~ q) ∨ (~p ∧ q) ∨ (~ p ∧ ~ q)
Consider
(p ∧~ q) ∨ (~ p ∧ q) ∨ (~ p ∧ ~ q)
≡ (p ∧ ~ q) ∨ [~ p ∧ (q ∨ ~ q)] [Distributive Law]
≡ (p ∧ ~ q) ∨ [~ p ∧ T] [Complement Law]
≡ (p ∧ ~ q) ∨ ~ p [Identity Law]
≡ ~ p ∨ (p ∧ ~ q) [Commutative Law]
≡ (~p ∨ p) ∧ (~p ∧ ~ q) [Distributive Law]
≡ t ∧ (~ p ∨ ~ q) [Law of Complement]
≡ ~ p ∨ ~ q [Identity Law]
The alternative arrangement for the given circuit is as follows:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy