Archangel Macsika
Use the truth tables method to determine whether (¬p ∨ q) ∧ (q → ¬r ∧ ¬p) ∧ (p ∧ r) is satisfiable.
The Answer to the Question
is below this banner.
Can't find a solution anywhere?
NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?
Get the Answers Now!You will get a detailed answer to your question or assignment in the shortest time possible.
Here's the Solution to this Question
Solution:
Δ = {(¬p ∨ q) ∧ (q → ¬r ∧ ¬p) ∧ (p ∧ r)}
If any sentence evaluates to 0, then Δ as a whole is not satisfied by the truth assignment. If a satisfying truth assignment is found, then Δ is determined to be satisfiable. If no satisfying truth assignment is found, then Δ is unsatisfiable.
In this question, every row ends with Δ not satisfied. So the truth table method concludes that Δ is unsatisfiable.