Advertisements
Advertisements
प्रश्न
Without using truth table prove that:
~ (p ∨ q) ∨ (~ p ∧ q) ≡ ~ p
Advertisements
उत्तर
We have,
L.H.S. = ∼(p ∨ q) ∨ (∼p ∧ q)
= (∼ p ∧ ∼q) ∨ (∼p ∧ q) ....(By De Morgan's Law)
= ∼p ∧ (∼q ∨ q) ....(By Distributive Law)
= ∼p ∧ T ....(By Complement Law)
= ∼p
R.H.S. = ∼p
L.H.S. = R.H.S.
संबंधित प्रश्न
Using truth table, prove that ~ p ∧ q ≡ (p ∨ q) ∧ ~ p
Write the following compound statement symbolically.
Nagpur is in Maharashtra and Chennai is in Tamil Nadu.
Construct the truth table of the following statement pattern.
(p ∧ ∼q) ↔ (p → q)
Construct the truth table of the following statement pattern.
∼ p ∧ [(p ∨ ∼ q) ∧ q]
Construct the truth table of the following statement pattern.
[p → (q → r)] ↔ [(p ∧ q) → r]
Construct the truth table of the following:
(∼p ∨ ∼q) ↔ [∼(p ∧ q)]
Construct the truth table of the following:
[(∼p ∨ q) ∧ (q → r)] → (p → r)
Determine the truth values of p and q in the following case:
(p ∨ q) is T and (p ∧ q) is T
Determine the truth values of p and q in the following case:
(p ∧ q) is F and (p ∧ q) → q is T
Express the following statement in symbolic form.
Even though it is cloudy, it is still raining.
Write the following statement in symbolic form.
Milk is white if and only if the sky is not blue.
Write the following statement in symbolic form.
Stock prices are high if and only if stocks are rising.
Find the truth value of the following statement.
It is not true that 3 − 7i is a real number.
If p and q are true and r and s are false, find the truth value of the following compound statement.
(p → q) ↔ ~(p ∨ q)
If p and q are true and r and s are false, find the truth value of the following compound statement.
[(p ∨ s) → r] ∨ ~ [~ (p → q) ∨ s]
If p : He swims
q : Water is warm
Give the verbal statement for the following symbolic statement:
p ↔ ~ q
If p : He swims
q : Water is warm
Give the verbal statement for the following symbolic statement.
q ∧ ~ p
Negation of “some men are animal” is ______.
If p : Proof is lengthy.
q : It is interesting.
Express the following statement in symbolic form.
It is interesting iff the proof is lengthy.
Let p : Sachin wins the match.
q : Sachin is a member of Rajya Sabha.
r : Sachin is happy.
Write the verbal statement of the following.
p→(q ∨ r)
Let p : Sachin wins the match.
q : Sachin is a member of Rajya Sabha.
r : Sachin is happy.
Write the verbal statement of the following.
(p ∧ q) ∧ ∼ r
Let p : Sachin wins the match.
q : Sachin is a member of Rajya Sabha.
r : Sachin is happy.
Write the verbal statement of the following.
∼ (p ∨ q) ∧ r
Rewrite the following statement without using conditional –
(Hint : p → q ≡ ∼ p ∨ q)
If price increases, then demand falls.
Rewrite the following statement without using conditional –
(Hint : p → q ≡ ∼ p ∨ q)
If demand falls, then price does not increase.
Write the negation of the following.
Ramesh is intelligent and he is hard working.
Write the negation of the following.
If x ∈ A ∩ B, then x ∈ A and x ∈ B.
Write the negation of the following statement.
7 is prime number and Tajmahal is in Agra.
Write the negation of the following statement.
10 > 5 and 3 < 8
Write the negation of the following statement.
∀ n ∈ N, n + 3 > 9.
Negation of p → (p ˅ ∼ q) is ______
The negation of the statement (p ˄ q) `→` (r ˅ ∼ p) is ______.
Using truth table prove that p ˅ (q ˄ r) ≡ (p ˅ q) ˄ (p ˅ r)
Write the negation of p → q
Choose the correct alternative:
A biconditional statement is the conjunction of two ______ statements
State whether the following statement is True or False:
The converse of inverse of ~ p → q is q → ~ p
Given 'p' and 'q' as true and 'r' as false, the truth values of p v (q ∧ ~r) and (p → r) ∧ q are respectively
The Boolean expression ∼(p ∨ q) ∨ (∼p ∧ q) is equivalent to ______
The negation of the statement: "Getting above 95% marks is a necessary condition for Hema to get admission in good college'' is ______
Conditional of p → q is equivalent to p → ∼ q.
If p : A man is happy, q : A man is rich, then the symbolic form of ‘A man is neither happy nor rich is ______.
Express the following compound statement symbolically:
3 + 8 ≥ 12 if and only if 5 × 4 ≤ 25
If p, q are true statements and r, s are false statements, then write the truth value of the compound statement
(p `→` ∼ r) `→` (q ∧ s)
Write the negation of (p `leftrightarrow` q).
Using truth table prove that:
~ (p `leftrightarrow` q) ≡ (p ∧ ~ q) ∨ (q ∧ ~ p)
