Advertisements
Advertisements
प्रश्न
Assuming the first statement p and second as q. Write the following statement in symbolic form.
If the question paper is not easy then we shall not pass.
Advertisements
उत्तर
Let p : The question paper is not easy.
q : We shall not pass.
The symbolic form is p → q.
APPEARS IN
संबंधित प्रश्न
Using the truth table, prove the following logical equivalence :
p ↔ q ≡ (p ∧ q) ∨ (~p ∧ ~q)
Write converse, inverse contrapositive of the statement "If two triangles are not congruent then their areas are not equal.
Write the following compound statement symbolically.
Hima Das wins gold medal if and only if she runs fast.
Construct the truth table of the following statement pattern.
(p ∧ q) ↔ (q ∨ r)
Construct the truth table of the following statement pattern.
∼ p ∧ [(p ∨ ∼ q) ∧ q]
Construct the truth table of the following statement pattern.
(∼ p → ∼ q) ∧ (∼ q → ∼ p)
Construct the truth table of the following:
∼ (∼p ∧ ∼q) ∨ q
Express the following statement in symbolic form.
e is a vowel or 2 + 3 = 5
Write the truth value of the negation of the following statement.
`sqrt5` is an irrational number.
If p and q are true and r and s are false, find the truth value of the following compound statement.
(p → q) ∨ (r ∧ s)
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]
Fill in the blanks :
Conjunction of two statement p and q is symbolically written as ______.
If p : Proof is lengthy.
q : It is interesting.
Express the following statement in symbolic form.
If proof is lengthy then it is interesting.
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.
If x ∈ A ∩ B, then x ∈ A and x ∈ B.
Rewrite the following statement without using the connective ‘If ... then’.
If 10 − 3 = 7 then 10 × 3 ≠ 30.
Write the negation of the following statement.
∀ n ∈ N, n + 3 > 9.
If p → q is an implication, then the implication ∼ q → ∼ p is called its
Without using truth table prove that:
~ (p ∨ q) ∨ (~ p ∧ q) ≡ ~ p
Using truth table prove that p ˅ (q ˄ r) ≡ (p ˅ q) ˄ (p ˅ r)
Negation of “Some men are animal” is ______.
The symbolic form of the following circuit is (where p, q represents switches S1 and S2 closed respectively)
The statement, 'If I go to school, then I will get knowledge' 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 ______
Let p, q and r be any three logical statements. Which of the following is true?
If p : A man is happy, q : A man is rich, then the symbolic form of ‘A man is neither happy nor rich is ______.
Write the following statement in symbolic form.
It is not true that `sqrt(2)` is a rational number.
Using the statements
p: Seema is fat,
q: Seema is happy,
Write the following statements in symbolic form;
- Seema is thin and happy.
- If Seema is fat then she is unhappy.
Construct the truth table for the statement pattern:
[(p → q) ∧ q] → p
