Advertisements
Advertisements
Question
Using truth table, examine whether the following statement pattern is tautology, contradiction or contingency: p ∨ [∼(p ∧ q)]
Solution
Truth Table
| (1) | (2) | (3) | (4) | (5) |
| p | q | p ∧ q | ∼(p ∧ q) | p ∨ [∼(p ∧ q)] |
| T | T | T | F | T |
| T | F | F | T | T |
| F | T | F | T | T |
| F | F | F | T | T |
All entries in coloumn (5) are T's
p ∨ [∼(p ∧ q)] is Tautology.
APPEARS IN
RELATED QUESTIONS
Express the following statement in symbolic form and write its truth value.
"If 4 is an odd number, then 6 is divisible by 3 "
Use the quantifiers to convert the following open sentence defined on N into true statement:
x2 ≥ 1
Write converse and inverse of the following statement :
"If Ravi is good in logic then Ravi is good in Mathematics."
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(p ↔ q) ∧ (p → ∼ q)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(∼ p → q) ∧ (p ∧ r)
(p ∧ q) → r is logically equivalent to ________.
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 tautology.
(~p ∧ ~q ) → (p → q)
Prove that the following statement pattern is a tautology.
(~ p ∨ ~ q) ↔ ~ (p ∧ q)
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
If p is any statement then (p ∨ ∼p) is a ______.
Prove that the following pair of statement pattern is equivalent.
~(p ∧ q) and ~p ∨ ~q
Write the dual statement of the following compound statement.
Karina is very good or everybody likes her.
Write the negation of the following statement.
∃ n ∈ N, (n2 + 2) is odd number.
Write the negation of the following statement.
Some continuous functions are differentiable.
Using the rules of negation, write the negation of the following:
(p → r) ∧ q
Using the rules of negation, write the negation of the following:
(~p ∧ q) ∧ (~q ∨ ~r)
With proper justification, state the negation of the following.
(p → q) ∨ (p → r)
Construct the truth table for the following statement pattern.
(p ∧ r) → (p ∨ ~q)
What is tautology? What is contradiction?
Show that the negation of a tautology is a contradiction and the negation of a contradiction is a tautology.
Determine whether the following statement pattern is a tautology, contradiction, or contingency.
[(p ∧ q) ∨ (~p)] ∨ [p ∧ (~ q)]
Determine whether the following statement pattern is a tautology, contradiction, or contingency.
[~(p ∨ q) → p] ↔ [(~p) ∧ (~q)]
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 ↔ q ≡ ~(p ∧ ~q) ∧ ~(q ∧ ~p)
State the dual of the following statement by applying the principle of duality.
(p ∧ ~q) ∨ (~ p ∧ q) ≡ (p ∨ q) ∧ ~(p ∧ q)
State the dual of the following statement by applying the principle of duality.
2 is even number or 9 is a perfect square.
Write the dual of the following.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (q ∨ r)
Which of the following is not true for any two statements p and q?
The statement pattern (∼ p ∧ q) is logically equivalent to ______.
Show that the following statement pattern is a contingency:
(p→q)∧(p→r)
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)].
