We read your photo as:

Show that eg(p o q) and p ext and not q are logically equivalent.

Computer Science

ScanSolve AI Answer

Step-by-step solution

2 steps

Here are the solutions to the questions from the image:

Q2. Solve the following "Short Questions".

(i) Show that ¬(p∨q)\neg(p \lor q) and ¬p∧¬q\neg p \land \neg q are logically equivalent.

  1. Construct a truth table for ¬(p∨q)\neg(p \lor q).

    pqp∨q¬(p∨q)TTTFTFTFFTTFFFFT\begin{array}{|c|c|c|c|} \hline p & q & p \lor q & \neg(p \lor q) \\ \hline T & T & T & F \\ T & F & T & F \\ F & T & T & F \\ F & F & F & T \\ \hline \end{array}

  2. Step 2

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

More Computer Science Questions

QShow that (p q) and p q are logically equivalent.QProve that (p q) is logically equivalent to p q using a truth table.QConstruct a truth table for the expression p o (p ext or q) and determine if it is a tautology.QWhat is the negation of the compound statement (p q)?QProve that p (p q) is a tautology using a truth table.
See all Computer Science questions →
Got a syllabus? Photograph it and I'll tell you what's due and what's worth the most.
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