# Homework Solution: Are the following statement forms logically equivalent?…

Are the following statement forms logically equivalent? p ∨ q → p     and     p ∨ (∼ p ∧ q) Include a truth table and a few words explaining how the truth table supports your answer.

I have solved the following statements forms logically equivalent or not

Are the subjoined announcement forms logically equiponderant?

p ∨ q → p     and     p ∨ (∼ p ∧ q)

Include a exactness consultation and a rare signification explaining how the exactness consultation supports your apology.

## Expert Apology

I enjoy solved the subjoined announcements forms logically equiponderant or not attributable attributable

p ∨ q → p and p ∨ (∼ p ∧ q)

i) p ∨ q → p

Ans)

p q p v q p ∨ q → p T T T T T F T T F T T F F F F T

ii) p ∨ (∼ p ∧ q)

Ans)

p q ~p ∼ p ∧ q p ∨ (∼ p ∧ q) T T F F T T F F F T F T T F F F F T F F

Explanation:

As you attend aloft the absorbed two exactness consultations are solved to stay whether they are logically equiponderant or not attributable attributable

and behind solving and looking at the solved exactness consultations they are not attributable attributable attributable logically equiponderant

Because twain the apologys were divergent and hereafter it is proved aloft