A compound proposition is satisfiable if there is an assignment of truth values to its
variables that makes it true (that is when it is a tautology or a contingency)
Determine whether the compound proposition is satisfiable:
(p → q) ∧ (p → ¬q) ∧ (¬p → q) ∧ (¬p → ¬q)
Comments
Leave a comment