Scribd
Upload
30 views4 pages

Logic Practical

1. The document discusses logic and quantified statements. It defines quantifiers such as "there exists" and "for all" and how they are used to form quantified statements about collections and conditions. 2. Examples are provided to demonstrate writing the converse, inverse, and contrapositive of implications, determining the truth values and negations of quantified statements, and proving logical equivalencies without using truth tables. 3. Switching circuits and input/output tables are drawn to represent the logical expressions (p∧q)∨(¬p∧¬q) and (p∨q)∧¬p.

Uploaded by

Laxman Patil
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
30 views4 pages

Logic Practical

1. The document discusses logic and quantified statements. It defines quantifiers such as "there exists" and "for all" and how they are used to form quantified statements about collections and conditions. 2. Examples are provided to demonstrate writing the converse, inverse, and contrapositive of implications, determining the truth values and negations of quantified statements, and proving logical equivalencies without using truth tables. 3. Switching circuits and input/output tables are drawn to represent the logical expressions (p∧q)∨(¬p∧¬q) and (p∨q)∧¬p.

Uploaded by

Laxman Patil
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/ 4

1.

Logic
Let us Recall
T h e converse, inverse and contrapositive of the implication p>q are:

Converse
Inverse
Contrapositive: ~ q P
and quantilied Statements Look at the following
Quantifiers
statements:
P:There exists an even prime number in the set of natural numbers"
: "All natural numbers are positive".
Each of them asserts a condition for some or all objects in a collection.
Words "there exists" and "for all" are called quantifiers. "There exists"
is called existential quantifier and is denoted by symbol a "For all" is
called universal quantifier and is denoted by v. Statements involving
Every quantified statement
quantifiers are called quantified statements.

collection and a condition. In statement the


corresponds to a

collection is 'the set of natural numbers' and the condition is "being

even prime'.
What is the condition in the statement q ?
A statement quantified by universal quantifier v is true if all objects
in the collection satisfy the condition. And it is false if at least one

object in the collection does not satisfy the condition.


A statement quantified by existential quantifier 3 is true if at least
one object in the collection satisfy the condition. And it is false if no

object in the collection satisfy the condition.

Idempotent Law PAP= P,_ PVp=


Commutative Lawp v q =qVppA9 =4 ^P
Associative Law
P v (q V r) = (p V ) v r =p vqVr
|Distributive Law P Aq v 1 =(p A g) v (pA r)

De Morgan's Law p ) =~p V q p V q) =PA ~q


F =p, T= T
Identity Law P A T= p. p aF = p v p v

Complement Law PA~ p = Fp vp T


=
Absorption Law Pvp q)=ppr p vq) =P_
Conditional Low p4"-P V4
Biconditional Lawp y= (p g ly p) = V9 AVPDI
Ex. (1) Write the converse, inverse, contrapositive and the negation of
the implication "lf two sides of a triangle are congruent then

it's two angles are congrucnt.


Solution
Conversc If two angles of a triangle are congruent then it's

two sides arc congruent.


Inverse If two sides of a triangle are not congruent then it's
Iwo angles are not congruent.
Contrapositive If two angles of a triangle are not congruent then
it's two sides are not congruent.
Negation :Two sides of a triangle are congruent but it's two
angles are not congruent.
Ex. (2) Write (a) truth values and (b) negations of the following
statements:
i) VxeR,x2 is positive. ii) ar eR,2 is not positive.
ii) Every square is a rectangle. iv) Some parallelograms
are rectangles.
Solution
a) Truth values
i) false because the square of 0 is not positive
ii) true because the square of 0 is not positive
ii) true iv) true
b) Negations
i) 3xeR,x is not positive. 1i) Vre R, x2 is positive.
iii) There exists square which is not
a a
rectangle.
iv) No parallelogram is a rectangle.

Ex. (3) Without using truth table prove that


}(pvq)n- p]>-9=q p
Solution
L.H.S. (pvq)n -p|4
(rvo) Py laud
(.CondiHona la
*** **''*
....)
Prly-v (.De.Mamman S..aw..)
P P}- (De...Manqan's..Law....)
Irp p) (Distmbulive.law..

.Complemernt..law.
dentity.. Llau.
(.Associafive..law........)
dempotent.. law..
..Conditional.law.
L. H. S. = R. H. S.

Ex. (4) Using truth table prove that (pe>q)=(pPa-4)v(4n~ P).


Solution:
VI VIII IX
I V IV V VI
P P P(PA~q)v{qap)
T TFF T E E
TFFT F T F
FTT
FFT E
From column (VI) and (IX) we conclude that

( p )PAn9)V (RAnp)....
Ex. (5) Is -(pq) equivalent to ( p)eq ? Justify.

Solution:I .I. IL. ....V..


p P.p9p9.ulP9)

.. . E.

..T E...E .. .FE. .T..


F.. E.. ..

. ...F. . ...E. .....


***

Dom..Calumn..no. I.andy..ue..oncude..

that.lpq=laup)2..
EX. (6) Draw the switching circuits and prepare the input output tables
for statement patterns
a) (png)v(- pa~g) b) (pvg)n-
Solution :elet.p..suwidch..S,.is.closed
S1 Sa
.9.s.closed....
up.Suurth.sis.closed Si
ug.Suitch.Sis.closed
p Pnq.ap.uq..poqlvlppAaig).
dplivq
.. O..O... . . .

.. .a. .O.......O.... .
.0... . .. . . .
...
........L .. .

quqPq.pvaang.
...
S2
... .0......
..O...O.. . .0 ****

Ex. (7).Using truth table prove that


(pag)vr=(pvr)a(gvr)
Solution.P. pngpnglvr p.qv (pvrnlqve).
T T T T
T
*

F TF F

...E..

Sign of Teacher:

You might also like