Advertisements
Advertisements
Question
Prepare truth table for (p ˄ q) ˅ ~ r
(p ∧ q) ∨ ~ r
Solution
(p ∧ q) ∨ ~ r
| p | q | r | ~r | p ∧ q | (p ∧ q) ∨ ~ r |
| T | T | T | F | T | T |
| T | T | F | T | T | T |
| T | F | T | F | F | F |
| T | F | F | T | F | T |
| F | T | T | F | F | F |
| F | T | F | T | F | T |
| F | F | T | F | F | F |
| F | F | F | T | F | T |
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 "
Prove that the following statement pattern is equivalent :
(p ∨ q) → r and (p → r) ∧ (q → r)
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 )
Express the following statement in symbolic form and write its truth value.
"If 4 is an odd number, then 6 is divisible by 3."
Show that the following statement pattern in contingency :
(~p v q) → [p ∧ (q v ~ q)]
Prove that the following statement pattern is equivalent:
(p v q) → r and (p → r) ∧ (q → r)
Write the negation of the Following Statement :
∀ y ∈ N, y2 + 3 ≤ 7
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.
Write converse and inverse of the following statement :
"If Ravi is good in logic then Ravi is good in Mathematics."
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 ∨ 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)
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 → q)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
(∼ p → q) ∧ (p ∧ r)
Examine whether the following statement pattern is a tautology or a contradiction or a contingency.
[p → (∼ q ∨ r)] ↔ ∼ [p → (q → r)]
(p ∧ q) → r is logically equivalent to ________.
Inverse of statement pattern (p ∨ q) → (p ∧ q) is ________ .
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)
Prepare truth tables for the following statement pattern.
(~ p ∨ q) ∧ (~ 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.
(~ 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 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 statement pattern is a contradiction.
(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∧~q)
Show that the following statement pattern is contingency.
(p → q) ↔ (~ p ∨ q)
Show that the following statement pattern is contingency.
(p → q) ∧ (p → r)
Using the truth table, verify.
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Using the truth table, verify
p → (p → q) ≡ ~ q → (p → q)
Using the truth table, verify
~(p → ~q) ≡ p ∧ ~ (~ q) ≡ p ∧ q
Using the truth table, verify
~(p ∨ q) ∨ (~ p ∧ q) ≡ ~ p
Prove that the following pair of statement pattern is equivalent.
p ↔ q and (p → q) ∧ (q → p)
Prove that the following pair of statement pattern is equivalent.
~(p ∧ q) and ~p ∨ ~q
Write the dual of the following:
p ∨ (q ∨ r) ≡ (p ∨ q) ∨ r
Write the dual of the following:
~(p ∧ q) ≡ ~ p ∨ ~ q
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.
Radha and Sushmita cannot read Urdu.
Write the negation of the following statement.
All the stars are shining if it is night.
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
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)
Construct the truth table for the following statement pattern.
(p ∧ r) → (p ∨ ~q)
Construct the truth table for the following statement pattern.
(p ∨ r) → ~(q ∧ r)
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) ∧ (q ∧ r)] ∨ (~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)] ∧ r ≡ 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) ∧ ~(q ∧ ~p)
Write the converse, inverse, contrapositive of the following statement.
If I do not work hard, then I do not prosper.
State the dual of the following statement by applying the principle of duality.
(p ∧ ~q) ∨ (~ p ∧ q) ≡ (p ∨ q) ∧ ~(p ∧ q)
Write the dual of the following.
(~p ∧ q) ∨ (p ∧ ~q) ∨ (~p ∧ ~q)
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.
The false statement in the following is ______.
Write the converse and contrapositive of the following statements.
“If a function is differentiable then it is continuous”
Write the dual of the following
(p ˄ ∼q) ˅ (∼p ˄ q) ≡ (p ˅ q) ˄ ∼(p ˄ q)
Choose the correct alternative:
If p is any statement, then (p ˅ ~p) is a
Choose the correct alternative:
If p → q is an implication, then the implication ~q → ~p is called its
The contrapositive of p → ~ q is ______
Write the dual of the following.
13 is prime number and India is a democratic country
If p → (∼p v q) is false, then the truth values of p and q are respectively
The statement pattern (p ∧ q) ∧ [~ r v (p ∧ q)] v (~ p ∧ q) is equivalent to ______.
The equivalent form of the statement ~(p → ~ q) is ______.
The statement pattern (∼ p ∧ q) is logically equivalent to ______.
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.
If p, q are true statements and r, s are false statements, then find the truth value of ∼ [(p ∧ ∼ r) ∨ (∼ q ∨ s)].
