Home
Class 12
MATHS
(p vv p) hArr p, (p ^^ p) hArr p are und...

`(p vv p) hArr p, (p ^^ p) hArr p` are under:

A

Idempotent laws

B

Absorption laws

C

Chain rule

D

Commutative laws.

Text Solution

AI Generated Solution

The correct Answer is:
To solve the question regarding the logical expressions `(p ∨ p) ↔ p` and `(p ∧ p) ↔ p`, we need to identify which logical law they correspond to. Let's break down the solution step by step. ### Step-by-Step Solution 1. **Understanding the Expressions**: - The first expression is `(p ∨ p) ↔ p`, which means "p or p is equivalent to p". - The second expression is `(p ∧ p) ↔ p`, which means "p and p is equivalent to p". 2. **Analyzing the First Expression**: - According to the **Idempotent Law** in logic, we have: - \( p \lor p \equiv p \) - This means that the disjunction (OR operation) of a statement with itself is equivalent to the statement itself. 3. **Analyzing the Second Expression**: - Similarly, for the conjunction (AND operation), the **Idempotent Law** states: - \( p \land p \equiv p \) - This indicates that the conjunction of a statement with itself is also equivalent to the statement itself. 4. **Conclusion**: - Both expressions `(p ∨ p) ↔ p` and `(p ∧ p) ↔ p` are examples of the **Idempotent Law**. - Therefore, the answer to the question is that both statements are under the **Idempotent Law**. ### Final Answer The expressions `(p ∨ p) ↔ p` and `(p ∧ p) ↔ p` are under the **Idempotent Law**. ---
Promotional Banner

Topper's Solved these Questions

  • MATHEMATICAL REASONING

    ML KHANNA|Exercise PROBLEM SET (1)(FILL IN THE BLANKS)|22 Videos
  • MATHEMATICAL REASONING

    ML KHANNA|Exercise PROBLEM SET (1)(TRUE OR FALSE)|21 Videos
  • MATHEMATICAL REASONING

    ML KHANNA|Exercise PROBLEM SET (2) ASSERTION/REASON|3 Videos
  • LOGARITHMS AND SURDS

    ML KHANNA|Exercise Miscellaneous exercise|3 Videos
  • MATRICES

    ML KHANNA|Exercise COMPREHENSION|3 Videos

Similar Questions

Explore conceptually related problems

~ ( ~p) harr p is

If p and q have truth value 'F', then the truth values of (~ p vv q) harr ~(p ^^ q) and p harr (p to ~q) are respectively

~ ( p hArr q) is-

~ [ ~ p ^^ ( p harr q)] -=

p vv ~(p ^^ q) is a

~(p hArr q) is

(p ^^ q) vv (~q ^^ p) -=

~(prArr q)hArr ~pvv p) is a