We read your photo as:

Prove that p (p q) is a tautology using a truth table.

Computer Science

ScanSolve AI Answer

Step-by-step solution

3 steps
  1. Construct a truth table for the expression ¬p→(p→q)\neg p \to (p \to q).

    We need columns for pp, qq, ¬p\neg p, p→qp \to q, and ¬p→(p→q)\neg p \to (p \to q).

  2. Fill in the truth values for all possible combinations of pp and qq.

    Recall that p→rp \to r is false only when pp is true and rr is false; otherwise, it is true.

    pq¬pp→q¬p→(p→q)TTFTTTFFFTFTTTTFFTTT\begin{array}{|c|c|c|c|c|} \hline p & q & \neg p & p \to q & \neg p \to (p \to q) \\ \hline T & T & F & T & T \\ T & F & F & F & T \\ F & T & T & T & T \\ F & F & T & T & T \\ \hline \end{array}
  3. Examine the final column for ¬p→(p→q)\neg p \to (p \to q).

    All the truth values in the column for ¬p→(p→q)\neg p \to (p \to q) are 'T' (True).

    Since the expression ¬p→(p→q)\neg p \to (p \to q) is true for all possible truth values of pp and qq, it is a tautology.

Was this helpful?

Still stuck on this one?

Ask a follow-up, and the answer starts from this question.

Got a different question?Ask your own question
Handwritten step-by-step solution preview

Handwritten Step-by-Step Solution

Get this as a handwritten image on WhatsApp — like a tutor wrote it for you.

Try on WhatsApp