(𝑝 → 𝑞) ↔ (𝑞 ∨ ~𝑝)
Let us construct the trush table for the formula (𝑝→𝑞)↔(𝑞∨∼𝑝):(𝑝 → 𝑞) ↔ (𝑞 ∨ \sim 𝑝):(p→q)↔(q∨∼p):
pq𝑝→𝑞∼𝑝𝑞∨∼𝑝(𝑝→𝑞)↔(𝑞∨∼𝑝)001111011111100001111011\begin{array}{||c|c||c|c|c|c||} \hline\hline p & q & 𝑝 → 𝑞 & \sim 𝑝 & 𝑞 ∨ \sim 𝑝 & (𝑝 → 𝑞) ↔ (𝑞 ∨ \sim 𝑝)\\ \hline\hline 0 & 0 & 1 & 1 & 1 & 1\\ \hline 0 & 1 & 1 & 1 & 1 & 1\\ \hline 1 & 0 & 0 & 0 & 0 & 1\\ \hline 1 & 1 & 1 & 0 & 1 &1\\ \hline\hline \end{array}p0011q0101p→q1101∼p1100q∨∼p1101(p→q)↔(q∨∼p)1111
We conclude that this formula is tautology.
Need a fast expert's response?
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS!
Comments