SOLUTION: Determine if the two statements are logically equivalent, negations, or neither. (p ⋀ q ) → ∼ r; r → (∼ p ⋁ ∼ q) (Points : 1)

Algebra ->  Conjunction -> SOLUTION: Determine if the two statements are logically equivalent, negations, or neither. (p ⋀ q ) → ∼ r; r → (∼ p ⋁ ∼ q) (Points : 1)       Log On


   

Question 387904:
Determine if the two statements are logically equivalent, negations, or neither.
(p ⋀ q ) → ∼ r; r → (∼ p ⋁ ∼ q)
(Points : 1)
Negations
Neither
Logically equivalent

12.
Identify the type of statement using the hierarchy of connectives.
∼ p ⋀ q → q ⋁ r
(Points : 1)
Disjunction
Conditional
Conjunction
Negation

Answer by jim_thompson5910(35256) About Me  (Show Source):
You can put this solution on YOUR website!
11
If you use a transposition and De Morgan's Law, you'll see that the two statements are equivalent


12

This expression is a conditional expression. The first part is a conjunction while the second part is a disjunction. Also, the first term of the first part is the negation of p.