Advertisements
Advertisements
Question
Write the dual of the following:
~(p ∨ q) ∧ [p ∨ ~ (q ∧ ~ r)]
Solution
~(p ∧ q) ∨ [p ∧ ~ (q ∨ ~ r)]
APPEARS IN
RELATED QUESTIONS
Using truth table examine whether the following statement pattern is tautology, contradiction or contingency `(p^^~q) harr (p->q)`
Write the dual of the following statements:
Madhuri has curly hair and brown eyes.
Using truth table, examine whether the following statement pattern is tautology, contradiction or contingency: p ∨ [∼(p ∧ q)]
Show that the following statement pattern in contingency :
(~p v q) → [p ∧ (q v ~ q)]
Use the quantifiers to convert the following open sentence defined on N into true statement
5x - 3 < 10
State if the following sentence is a statement. In case of a statement, write down the truth value :
Every quadratic equation has only real roots.
Using the truth table prove the following logical equivalence.
p ↔ q ≡ ∼ [(p ∨ q) ∧ ∼ (p ∧ q)]
Using the truth table prove the following logical equivalence.
p → (q ∧ r) ≡ (p ∧ q) (p → r)
Using the truth table prove the following logical equivalence.
[∼ (p ∨ q) ∨ (p ∨ q)] ∧ r ≡ r
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
[p → (∼ q ∨ r)] ↔ ∼ [p → (q → r)]
Determine whether the following statement pattern is a tautology, contradiction or contingency:
[p → (q → r)] ↔ [(p ∧ q) → r]
Prepare truth tables for the following statement pattern.
p → (~ p ∨ q)
Prepare truth tables for the following statement pattern.
(~ p ∨ q) ∧ (~ p ∨ ~ q)
Prepare truth table for (p ˄ q) ˅ ~ r
(p ∧ q) ∨ ~ r
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
(~ q ∧ p) ∧ (p ∧ ~ p)
Prove that the following statement pattern is a contradiction.
(p ∨ q) ∧ (~p ∧ ~q)
Prove that the following statement pattern is a contradiction.
(p ∧ q) ∧ ~p
Fill in the blanks :
Inverse of statement pattern p ↔ q is given by –––––––––.
Show that the following statement pattern is contingency.
(p → q) ↔ (~ p ∨ q)
Show that the following statement pattern is contingency.
p ∧ [(p → ~ q) → q]
Using the truth table, verify.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Prove that the following pair of statement pattern is equivalent.
~(p ∧ q) and ~p ∨ ~q
Write the dual of the following:
(p ∨ q) ∨ r
Write the dual of the following:
~(p ∧ q) ≡ ~ p ∨ ~ q
Write the dual statement of the following compound statement.
A number is a real number and the square of the number is non-negative.
Write the negation of the following statement.
∃ n ∈ N, (n2 + 2) is odd number.
Using the rules of negation, write the negation of the following:
(p → r) ∧ q
With proper justification, state the negation of the following.
(p → q) ∧ r
Construct the truth table for the following statement pattern.
(p ∨ ~q) → (r ∧ p)
Determine whether the following statement pattern is a tautology, contradiction, or contingency.
[p → (~q ∨ r)] ↔ ~[p → (q → r)]
Using the truth table, prove the following logical equivalence.
p ∧ (~p ∨ q) ≡ p ∧ q
Write the converse, inverse, contrapositive of the following statement.
If a man is bachelor, then he is happy.
Write the dual of the following.
~(p ∨ q) ≡ ~p ∧ ~q
Express the truth of the following statement by the Venn diagram.
Some members of the present Indian cricket are not committed.
Complete the truth table.
p | q | r | q → r | r → p | (q → r) ˅ (r → p) |
T | T | T | T | `square` | T |
T | T | F | F | `square` | `square` |
T | F | T | T | `square` | T |
T | F | F | T | `square` | `square` |
F | T | T | `square` | F | T |
F | T | F | `square` | T | `square` |
F | F | T | `square` | F | T |
F | F | F | `square` | T | `square` |
The given statement pattern is a `square`
The statement pattern (p ∧ q) ∧ [~ r v (p ∧ q)] v (~ p ∧ q) is equivalent to ______.
If p → q is true and p ∧ q is false, then the truth value of ∼p ∨ q is ______
The converse of contrapositive of ∼p → q is ______.
Prepare truth table for the statement pattern `(p -> q) ∨ (q -> p)` and show that it is a tautology.
If p, q are true statements and r, s are false statements, then find the truth value of ∼ [(p ∧ ∼ r) ∨ (∼ q ∨ s)].