In: Advanced Math
(c) (¬p ∨ q) → (p ∧ q) and p
(d) (p → q) ∨ p and T
I was wondering if I could get help proving these expressions
are logically equivalent by applying laws of logic.
Also these 2 last questions im having trouble with.
Rewrite the negation of each of the following logical expressions
so that all negations
immediately precede predicates.
(a) ¬∀x(¬P(x) → Q(x))
(b) ¬∃x(P(x) → ¬Q(x))