Consider the following:
p: This computer is good.
q: This computer is cheap.
Write the statement in symbolic form:
This computer is neither good nor cheap.

Answer

To express the statement "This computer is neither good nor cheap" in symbolic form, we first need to understand the individual statements and how to represent negation in logic.

1. Identify the statements:
- Let \( p \) represent "This computer is good."
- Let \( q \) represent "This computer is cheap."

2. Understand the meaning of "neither...nor":
- The phrase "neither good nor cheap" means that both statements \( p \) and \( q \) are false. In logical terms, this can be expressed as the negation of both \( p \) and \( q \).

3. Write the negation of both statements:
- The negation of \( p \) (This computer is not good) is represented as \( \neg p \).
- The negation of \( q \) (This computer is not cheap) is represented as \( \neg q \).

4. Combine the negations:
- Since we are stating that the computer is neither good nor cheap, we can combine these two negations using the logical conjunction (AND) operator. Thus, we write:
\[ \neg p \land \neg q \]

5. Final symbolic representation:
- Therefore, the statement "This computer is neither good nor cheap" in symbolic form is:
\[ \neg p \land \neg q \]