Advertisements
Advertisements
Question
Using the truth table, prove the following logical equivalence.
p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
Advertisements
Solution
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| p | q | r | q ∨ r | p ∧ (q ∨ r) | p ∧ q | p ∧ r | (p ∧ q) ∨ (p ∧ r) |
| T | T | T | T | T | T | T | T |
| T | T | F | T | T | T | F | T |
| T | F | T | T | T | F | T | T |
| T | F | F | F | F | F | F | F |
| F | T | T | T | F | F | F | F |
| F | T | F | T | F | F | F | F |
| F | F | T | T | F | F | F | F |
| F | F | F | F | F | F | F | F |
The entries in columns 5 and 8 are identical.
∴ p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
RELATED QUESTIONS
Prove that the following statement pattern is equivalent :
(p ∨ q) → r and (p → r) ∧ (q → r)
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 )
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
Prove that the following statement pattern is equivalent:
(p v q) → r and (p → r) ∧ (q → r)
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.
Examine whether the following statement (p ∧ q) ∨ (∼p ∨ ∼q) is a tautology or contradiction or neither of them.
Using the truth table prove the following logical equivalence.
∼ (p ∨ q) ∨ (∼ p ∧ q) ≡ ∼ p
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) ∧ (p → ∼ q)
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)
Determine whether the following statement pattern is a tautology, contradiction, or contingency:
(p → q) ∧ (p ∧ ∼q)
Determine whether the following statement pattern is a tautology, contradiction or contingency:
(p ∧ q) ∨ (∼p ∧ q) ∨ (p ∨ ∼q) ∨ (∼p ∧ ∼q)
Determine whether the following statement pattern is a tautology, contradiction or contingency:
(p → q) ∨ (q → p)
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)
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
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)
Fill in the blanks :
Inverse of statement pattern p ↔ q is given by –––––––––.
Show that the following statement pattern is contingency.
(p → q) ∧ (p → r)
Using the truth table, verify
~(p → ~q) ≡ p ∧ ~ (~ q) ≡ p ∧ q.
Using the truth table, verify
~(p ∨ q) ∨ (~ p ∧ q) ≡ ~ p
Write the dual of the following:
(p ∨ q) ∨ r
Write the dual of the following:
p ∨ (q ∨ r) ≡ (p ∨ q) ∨ r
Write the dual statement of the following compound statement.
Radha and Sushmita cannot read Urdu.
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.
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) v (~ q → ~ r)
Construct the truth table for the following statement pattern.
(p ∨ r) → ~(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) ∧ (q ∧ r)] ∨ (~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 ∨ 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 dual of the following.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (q ∨ r)
Write the dual of the following.
~(p ∨ q) ≡ ~p ∧ ~q
Write the converse and contrapositive of the following statements.
“If a function is differentiable then it is continuous”
Choose the correct alternative:
If p → q is an implication, then the implication ~q → ~p is called its
The contrapositive of p → ~ q is ______
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) is logically equivalent to ______.
Write the negation of the following statement:
(p `rightarrow` q) ∨ (p `rightarrow` r)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency:
(∼p ∧ ∼q) → (p → q)
If p → q is true and p ∧ q is false, then the truth value of ∼p ∨ q is ______
In the triangle PQR, `bar(PQ) = 2bara and bar(QR)` = `2 bar(b)` . The mid-point of PR is M. Find following vectors in terms of `bar(a) and bar(b)` .
- `bar(PR)`
- `bar(PM)`
- `bar(QM)`
Prepare truth table for the statement pattern `(p -> q) ∨ (q -> p)` and show that it is a tautology.
