Advertisements
Advertisements
Question
The negation of p ∧ (q → r) is ______________.
Options
p ∨ ( ~q ∨ r )
~p ∧ ( q → r )
~p ∧ ( ~q → ~r )
~p ∨ ( q ∧ ~r )
Advertisements
Solution
~ [P ∧ (q → r)
=~[( P)] ∨ [~ (q → r)] ...(By De Morgan's law)
=~[( P)] ∨ [~ (~q ∨ r )] ...(By Conditional Law)
=~[( P)] ∨ [( q ∧ ~r )] ...(By De Morgan's law)
~ [ P ∧ ( q → r )] = ~ P ∨ ( q ∧ ~r )
APPEARS IN
RELATED QUESTIONS
Without using the truth table show that P ↔ q ≡ (p ∧ q) ∨ (~ p ∧ ~ q)
If A = {2, 3, 4, 5, 6}, then which of the following is not true?
(A) ∃ x ∈ A such that x + 3 = 8
(B) ∃ x ∈ A such that x + 2 < 5
(C) ∃ x ∈ A such that x + 2 < 9
(D) ∀ x ∈ A such that x + 6 ≥ 9
Using the rules of negation, write the negatlon of the following:
(a) p ∧ (q → r)
(b) ~P ∨ ~q
Write the truth value of the negation of the following statement :
cos2 θ + sin2 θ = 1, for all θ ∈ R
Rewrite the following statement without using if ...... then.
If a man is a judge then he is honest.
Rewrite the following statement without using if ...... then.
It 2 is a rational number then `sqrt2` is irrational number.
Rewrite the following statement without using if ...... then.
It f(2) = 0 then f(x) is divisible by (x – 2).
Without using truth table prove that:
∼ [(p ∨ ∼ q) → (p ∧ ∼ q)] ≡ (p ∨ ∼ q) ∧ (∼ p ∨ q)
Using rules in logic, prove the following:
p ↔ q ≡ ∼(p ∧ ∼q) ∧ ∼(q ∧ ∼p)
Using rules in logic, prove the following:
∼p ∧ q ≡ (p ∨ q) ∧ ∼p
Using the rules in logic, write the negation of the following:
(p ∨ q) ∧ (q ∨ ∼r)
Using the rules in logic, write the negation of the following:
p ∧ (q ∨ r)
Using the rules in logic, write the negation of the following:
(p → q) ∧ r
Let p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). Then, this law is known as ______.
Without using truth table, show that
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
Without using truth table, show that
p ∧ [(~ p ∨ q) ∨ ~ q] ≡ p
Without using truth table, show that
~ [(p ∧ q) → ~ q] ≡ p ∧ q
Without using truth table, show that
(p ∨ q) → r ≡ (p → r) ∧ (q → r)
Using the algebra of statement, prove that (p ∨ q) ∧ (~ p ∨ ~ q) ≡ (p ∧ ~ q) ∨ (~ p ∧ q).
The statement pattern p ∧ ( q v ~ p) is equivalent to ______.
The statement pattern [∼r ∧ (p ∨ q) ∧ (p ∨ q) ∧ (∼p ∧ q)] is equivalent to ______
If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is ______.
∼ ((∼ p) ∧ q) is equal to ______.
Without using truth table, prove that : [(p ∨ q) ∧ ∼p] →q is a tautology.
The simplified form of [(~ p v q) ∧ r] v [(p ∧ ~ q) ∧ r] is ______.
Without using truth table prove that
[(p ∧ q ∧ ∼ p) ∨ (∼ p ∧ q ∧ r) ∨ (p ∧ q ∧ r) ∨ (p ∧ ∼ q ∧ r) ≡ (p ∨ q) ∧ r
