Home
Class 12
MATHS
The negation of ~svv(~r^^s) is equivale...

The negation of `~svv(~r^^s) ` is equivalent to

A

`s^^~r`

B

`s^^(r^^~s)`

C

`svv(rvv~s)`

D

`s^^r`

Text Solution

Verified by Experts

The correct Answer is:
D
`~svv(~r^^s)=(~svv~r)^^(~svvs)`
`=~(s^^r) ^^t`
`=~(s^^r) `
So, negation is `s^^r`.
Promotional Banner

Topper's Solved these Questions

  • MATHMETICAL REASONING

    CENGAGE PUBLICATION|Exercise Single correct answer type|38 Videos

  • LOGARITHM AND ITS PROPERTIES

    CENGAGE PUBLICATION|Exercise JEE ADVANCED|1 Videos

  • MATRICES

    CENGAGE PUBLICATION|Exercise All Questions|509 Videos

Similar Questions

Explore conceptually related problems

The negation of ~svee(~rwedges) is equivalent to

The negation of qvv(p^^r) is-----

Consider the following relations: R = {(x, y) | x, y are real numbers and x = wy for some rational number w}; S={(m/n , p/q)"m , n , pandqa r ei n t e g e r ss u c ht h a tn ,q"!="0andq m = p n"} . Then (1) neither R nor S is an equivalence relation (2) S is an equivalence relation but R is not an equivalence relation (3) R and S both are equivalence relations (4) R is an equivalence relation but S is not an equivalence relation

The logical statement [~(~pvvq)vv(p^^r)]^^(~q^^r) is equivalent to

The negation of the statements p is denoted by -

Which one of the following relations on R is an equivalence relation?

The Boolean expression (p wedge r) rarr (p vee r) is equivalent to

Consider the statements p , q and r Statement - I : Negation of statement p^^(qvvr) " is " ~pvv(~q^^~r) Statement - II : Negation of pvvq" is "(~p)^^(~q), and " negation of "p ^^q " is " (~p)vv(~q)

Let A be a non-empty set. Then a relation R on A is said to be an equivalence relation on A. If R is ______