For each schema below, produce an equivalent schema in disjunctive normal form. 1.((P ∨ Q) → ~P) ⋀ (Q ⟺ ~R) 2.(Q → ~R) →
Posted: Wed Jul 06, 2022 11:45 am
For each schema below, produce an equivalent schema indisjunctive normal form.
1.((P ∨ Q) → ~P) ⋀ (Q ⟺ ~R)
2.(Q → ~R) → (P ⋀ (Q ∨ R))
3.(P ∨ ~(Q → R)) → ~(~R ⋀ Q)
1.((P ∨ Q) → ~P) ⋀ (Q ⟺ ~R)
2.(Q → ~R) → (P ⋀ (Q ∨ R))
3.(P ∨ ~(Q → R)) → ~(~R ⋀ Q)