Advertisements
Advertisements
Question
Write the negation of the following statement.
I will have tea or coffee.
Solution
Let p : I will have tea.
q : I will have coffee.
The given statement in symbolic form is p ∨ q.
Its negation is ~(p ∨ q) ≡ ~p ∧ ~q.
∴ The negation of given statement is ‘I will not have tea and coffee’.
APPEARS IN
RELATED QUESTIONS
Using truth table, prove that ~ p ∧ q ≡ (p ∨ q) ∧ ~ p
Write the following compound statement symbolically.
Angle is neither acute nor obtuse.
Construct the truth table of the following statement pattern.
p → [∼ (q ∧ r)]
Construct the truth table of the following statement pattern.
(∼ p → ∼ q) ∧ (∼ q → ∼ p)
If p ∧ q is false and p ∨ q is true, then ______ is not true.
Construct the truth table of the following:
[(∼p ∨ q) ∧ (q → r)] → (p → r)
Express the following statement in symbolic form.
I like playing but not singing.
Write the negation of the following statement.
It is false that Nagpur is capital of Maharashtra
Write the negation of the following statement.
2 + 3 ≠ 5
Write the truth value of the negation of the following statement.
`sqrt5` is an irrational number.
Write the following statement in symbolic form.
It is not true that “i” is a real number.
Write the following statement in symbolic form.
If Kutub-Minar is in Delhi then Taj-Mahal is in Agra.
Find the truth value of the following statement.
It is not true that 3 − 7i is a real number.
Find the truth value of the following statement.
3 is a prime number and an odd number.
Fill in the blanks :
Negation of “some men are animal” is –––––––––.
Assuming the first statement p and second as q. Write the following statement in symbolic form.
Mona likes Mathematics and Physics.
Assuming the first statement p and second as q. Write the following statement in symbolic form.
3 is prime number if 3 is perfect square number.
Assuming the first statement p and second as q. Write the following statement in symbolic form.
If Kiran drives the car, then Sameer will walk.
Assuming the first statement p and second as q. Write the following statement in symbolic form.
x3 + y3 = (x + y)3 if xy = 0.
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.
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 → 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 the connective ‘If ... then’.
If a quadrilateral is rhombus then it is not a square.
Rewrite the following statement without using the connective ‘If ... then’.
If 10 − 3 = 7 then 10 × 3 ≠ 30.
Consider the following statements.
- If D is dog, then D is very good.
- If D is very good, then D is dog.
- If D is not very good, then D is not a dog.
- If D is not a dog, then D is not very good.
Identify the pairs of statements having the same meaning. Justify.
Write the negation of the following statement.
7 is prime number and Tajmahal is in Agra.
Write the negation of p → q
Choose the correct alternative:
A biconditional statement is the conjunction of two ______ statements
Write the negation of the statement “An angle is a right angle if and only if it is of measure 90°”
If p, q are true statement and r is false statement, then which of the following statements is a true statement.
If p and q are true and rands are false statements, then which of the following is true?
The negation of ∼s ∨ (∼r ∧ s) is equivalent to ______
The Boolean expression ∼(p ∨ q) ∨ (∼p ∧ q) is equivalent to ______
Let S be a non-empty subset of R. Consider the following statement:
p: There is a rational number x ∈ S such that x > 0. Which of the following statements is the negation of the statement p?
The statement ∼(p ↔ ∼q) is ______.
Express the following compound statement symbolically:
3 + 8 ≥ 12 if and only if 5 × 4 ≤ 25
Write the negation of (p `leftrightarrow` q).
Construct the truth table for the statement pattern:
[(p → q) ∧ q] → p
