## Related questions with answers

Question

Use a truth table to verify the distributive law p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r).

Solution

Verified4.2 (5 ratings)

4.2 (5 ratings)

Step 1

1 of 3DEFINITIONS

Two propositions are equivalent, if they have the same truth value for every possible combination of truth values for the variables ($p,q,r,...$).

TRUTH TABLE

A conjunction $p\wedge q$ is true, if both (sub)propositions ($p$ and $q$) are true.

A disjunction $p\vee q$ is true, if either of the (sub)propositions ($p$ or $q$) are true.

A negation $\neg p$ is true, if the (sub)proposition $p$ is false.

A conditional statement $p\rightarrow q$ is true, if $p$ is false, or if both (sub)propositions are true.

A biconditional statement $p\leftrightarrow q$ is true, if both (sub)propositions are true or if both (sub)propositions are false.

## Create an account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy

## Create an account to view solutions

By signing up, you accept Quizlet's Terms of Service and Privacy Policy

## Recommended textbook solutions

#### Discrete Mathematics and Its Applications

7th Edition•ISBN: 9780073383095Kenneth Rosen4,283 solutions

#### Discrete Mathematics and Its Applications

8th Edition•ISBN: 9781259676512Kenneth Rosen4,397 solutions

## More related questions

- discrete math

1/4

- discrete math

1/7