Advertisements
Advertisements
प्रश्न
Determine whether the following statement pattern is a tautology, contradiction or contingency:
[(p ∧ (p → q)] → q
Advertisements
उत्तर
| p | q | p → q | p ∧ (p → q) | [p ∧ (p → q)] → q |
| T | T | T | T | T |
| T | F | F | F | T |
| F | T | T | F | T |
| F | F | T | F | T |
All the entries in the last column of the above truth table are T.
∴ [(p ∧ (p → q)] → q is a tautology.
APPEARS IN
संबंधित प्रश्न
Examine whether the following logical statement pattern is a tautology, contradiction, or contingency.
[(p→q) ∧ q]→p
Express the following statement in symbolic form and write its truth value.
"If 4 is an odd number, then 6 is divisible by 3 "
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.
Prove that the following statement pattern is a tautology : ( q → p ) v ( p → q )
If p and q are true statements and r and s are false statements, find the truth value of the following :
( p ∧ ∼ r ) ∧ ( ∼ q ∧ s )
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:
x2 ≥ 1
Prove that the following statement pattern is equivalent:
(p v q) → r and (p → r) ∧ (q → r)
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 ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
Using the truth table prove the following logical equivalence.
p → (q ∧ r) ≡ (p ∧ q) (p → r)
Using the truth table proves the following logical equivalence.
∼ (p ↔ q) ≡ (p ∧ ∼ q) ∨ (q ∧ ∼ p)
Determine whether the following statement pattern is a tautology, contradiction, or contingency:
[(p ∨ q) ∧ ∼p] ∧ ∼q
Prepare truth tables for the following statement pattern.
p → (~ p ∨ q)
Prove that the following statement pattern is a tautology.
(p → q) ↔ (~ q → ~ p)
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) ≡ p ∧ ~ (~ q) ≡ p ∧ q.
Prove that the following pair of statement pattern is equivalent.
p → q and ~ q → ~ p and ~ p ∨ q
Write the dual of the following:
(p ∨ q) ∨ r
Write the dual of the following:
~(p ∨ q) ∧ [p ∨ ~ (q ∧ ~ r)]
Write the dual statement of the following compound statement.
Karina is very good or everybody likes her.
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, n + 1 > 0
Write the negation of the following statement.
∃ n ∈ N, (n2 + 2) is odd number.
Write the converse, inverse, and contrapositive of the following statement.
If he studies, then he will go to college.
With proper justification, state the negation of the following.
(p ↔ q) v (~ q → ~ r)
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)]
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 ∧ (~p ∨ q) ≡ p ∧ q
Using the truth table, prove the following logical equivalence.
~p ∧ q ≡ [(p ∨ q)] ∧ ~p
Write the converse, inverse, contrapositive of the following statement.
If a man is bachelor, then he is happy.
State the dual of the following statement by applying the principle of duality.
p ∨ (q ∨ r) ≡ ~[(p ∧ q) ∨ (r ∨ s)]
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?
Using truth table verify that:
(p ∧ q)∨ ∼ q ≡ p∨ ∼ q
The statement pattern (∼ p ∧ q) is logically equivalent to ______.
Write the negation of the following statement:
(p `rightarrow` q) ∨ (p `rightarrow` r)
Prepare truth table for the statement pattern `(p -> q) ∨ (q -> p)` and show that it is a tautology.
