Advertisements
Advertisements
Question
Using the rules of negation, write the negation of the following:
~(p ∨ q) → r
Advertisements
Solution
~[~ (p ∨ q) → r] ≡ ~ (p ∨ q) ∧ ~ r ...[Negation of implication]
≡ (~ p ∧ ~ q) ∧ ~ r ...[De-morgan's law]
APPEARS IN
RELATED QUESTIONS
Examine whether the following logical statement pattern is a tautology, contradiction, or contingency.
[(p→q) ∧ q]→p
Using truth table examine whether the following statement pattern is tautology, contradiction or contingency `(p^^~q) harr (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 )
Using truth table, examine whether the following statement pattern is tautology, contradiction or contingency: p ∨ [∼(p ∧ q)]
Express the following statement in symbolic form and write its truth value.
"If 4 is an odd number, then 6 is divisible by 3."
Write the negation of the following statement :
If the lines are parallel then their slopes are equal.
By constructing the truth table, determine whether the following statement pattern ls a tautology , contradiction or . contingency. (p → q) ∧ (p ∧ ~ q ).
Using the truth table prove the following logical equivalence.
(p ∨ q) → r ≡ (p → r) ∧ (q → 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)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
[(p → q) ∧ ∼ q] → ∼ p
Inverse of statement pattern (p ∨ q) → (p ∧ q) is ________ .
Prepare truth tables for the following statement pattern.
p → (~ p ∨ q)
Prepare truth tables for the following statement pattern.
(p ∧ r) → (p ∨ ~ q)
Examine whether the following statement pattern is a tautology, a contradiction or a contingency.
(p ∧ ~ q) → (~ p ∧ ~ q)
Prove that the following statement pattern is a tautology.
(p ∧ q) → q
Show that the following statement pattern is contingency.
(p∧~q) → (~p∧~q)
Using the truth table, verify.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Write the dual statement of the following compound statement.
Radha and Sushmita cannot read Urdu.
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
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 ∧ r) ≡ (p ∨ q) ∧ (q ∨ r)
Choose the correct alternative:
If p is any statement, then (p ˅ ~p) is a
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`
If p → (∼p v q) is false, then the truth values of p and q are respectively
Determine whether the following statement pattern is a tautology, contradiction, or contingency:
[(∼ p ∧ q) ∧ (q ∧ r)] ∧ (∼ q)
The statement pattern (∼ p ∧ q) is logically equivalent to ______.
